Pinned Repositories
Counting-inversions-problem
Let A[1.. n] be an array of n distinct numbers. If i < j and A[i] > A[j], then the pair (i, j) is called an inversion of A. A modified merge sort algorithm is developed that determines the number of inversions in any permutation on n elements in Θ(nlgn) worst-case time.
Eight-queens-puzzle
The eight queens puzzle, or the eight queens problem, asks how to place eight queens on a chessboard without attacking each other.
Keras-MNIST
MNIST classification in Keras
Leetcode
a backup of my answers
M.S.-Thesis
CNN-Based Resource Allocation for Energy-Efficient D2D Communications
Naive-bayes-classifer-project
Using a Naive Bayes Classifier detects trash mails
RTP-based-VoIP
P2P VoIP application in Java using RTP and RTCP over UDP/IP.
Shawn1380's Repositories
Shawn1380/M.S.-Thesis
CNN-Based Resource Allocation for Energy-Efficient D2D Communications
Shawn1380/Leetcode
a backup of my answers
Shawn1380/RTP-based-VoIP
P2P VoIP application in Java using RTP and RTCP over UDP/IP.
Shawn1380/Counting-inversions-problem
Let A[1.. n] be an array of n distinct numbers. If i < j and A[i] > A[j], then the pair (i, j) is called an inversion of A. A modified merge sort algorithm is developed that determines the number of inversions in any permutation on n elements in Θ(nlgn) worst-case time.
Shawn1380/Eight-queens-puzzle
The eight queens puzzle, or the eight queens problem, asks how to place eight queens on a chessboard without attacking each other.
Shawn1380/Keras-MNIST
MNIST classification in Keras
Shawn1380/Naive-bayes-classifer-project
Using a Naive Bayes Classifier detects trash mails