LYCOS RETRIEVER 
Radix Sort
built 232 days ago
The Radix Sort has a linear complexity of O(k*N). The crude algorithm uses one pass to create counters, and 4 passes to sort 32 bits values according to 4 different radices. Hence the complexity is O(5*N), this is the best as well as the worst running time for this algorithm, which always runs in constant time.
Source:
The speed of Radix Sort largely depends on the inner basic operations, and if the operations are not efficient enough, Radix Sort can be slower than some other algorithms such as Quick Sort and Merge Sort. These operations include the insert and delete functions of the sublists and the process of isolating the digit you want.
Source:
Radix Sort proceeds in N steps. The input to Step k is a list sorted according to criterion C(k-1), and its output is a list sorted according to criterion C(k), where C(k) is a stronger criterion than C(k-1). The final criterion C(N) is the usual order relation <=.
Source:
Some LSD radix sort implementations allocate space for buckets by first counting the number of keys that belong in each bucket before moving keys into those buckets. The number of times that each digit occurs is stored in an array. Consider the previous list of keys viewed in a different way:
Source:
Radix sort has developed from its physical counterpart, where records were stored on punch cards and these cards were distributed into buckets during a single pass of their stack through a mechanical card sorter. For details, see
Source:
MSD radix sort is known to be optimally fast for in-memory sorting of binary strings, for a machine model which approximates many modern machines. The rsort program is a demonstration application of libradixsort. It reads standard input into memory, applies radixsort, and prints the results to standard output.
Source:
MORE ABOUT
Radix Sort