tailieunhanh - Lecture Design and Analysis of Algorithms: Lecture 16 - Dr. Sohail Aslam

We will consider three algorithms that are faster and work by not making comparisons. Counting sort assumes that the numbers to be sorted are in the range 1 to k where k is small. The basic idea is to determine the rank of each number in final sorted array. |