(algorithm)
Definition: A bucket sort where the function to determine the bucket is based on the range of possible keys.
Generalization (I am a kind of ...)
bucket sort, distribution sort.
Specialization (... is a kind of me.)
pigeonhole sort.
Author: ASK
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 2 June 2006.
HTML page formatted Mon Feb 2 13:10:40 2015.
Cite this as:
Art S. Kagel, "range sort", in
Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 2 June 2006. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/rangesort.html