LYCOS RETRIEVER 
Radix Sort: Algorithms
built 288 days ago
Plots to compare best quicksort, insertion sort, and radix sort: Two plots with average execution time on y-axis and input length, n, on x-axis. Use the same plot for all the algorithms so you can make a comparison. Simply connect the data points for an algorithm without performing any curve fitting, and label the curve with the algorithm's name. Use a plotting program, or simply plot by hand. The first plot has range of input lengths up to 256 to compare the algorithms on small inputs. The second plot has range of input from 64 through (or more) using log scale to compare the algorithms over a large range of input lengths.
Source:
A radix sort is a very fast sort algorithm. It doesn't use comparisons and ... is able to break the theoretical minimum O(N*logN) complexity. Radix sort is complexity O(k*N), where k is a constant. Note that radix sorting is not in-place, it requires additional storage, so it trades memory for speed. The overhead of copying means that it is only faster for fairly large datasets, so you are advised to only use it for collections of at least a few hundred items.
Source:
A number of sequential radix sort algorithms are given separately (in directory 508). Parallel radix-sort based on paralle-count sort is implemented in a variety of ways. Two copies of the same basic algorithm are included (one by A. Gerbessiotis and the other by S.Y. Lee) and an enhanced version (though slower in practice) by S.Y.Lee. There are two copies of these versions: one that works with one-sided communication under LAM MPI, BSPlib and PUB-Library and the other that works with two-sided communication under LAM MPI only. The code is implemented in ANSI C. (Note the allrdx.c allrdx.h code reflects earlier versions of some of above described programs that were tested under Critical Software's WMPI and may be present in the current release but with no or non safe code).
Source:
Paul E. Black, "radix sort", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 14 December 2005. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/radixsort.html
Source:
These functions are variants of most-significant-byte radix sorting; in particular, see D.E. Knuth’s Algorithm R and section 5.2.5, exercise 10. They take linear time relative to the number of bytes in the strings.
Source:
MORE ABOUT
Algorithms