Definition: Any sort algorithm where data is distributed from its input to multiple intermediate structures which are then gathered and placed on the output.
Generalization (I am a kind of ...)
Specialization (... is a kind of me.)
bucket sort, linear probing sort, shuffle sort, merge sort, radix sort, UnShuffle sort, restricted universe sort, strand sort, distributive partitioning sort.
Note: Many distribution sorts are also merge sorts depending on how the distribution is performed.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 2 June 2006.
HTML page formatted Fri Mar 25 16:20:34 2011.
Cite this as:
Art S. Kagel, "distribution sort", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 2 June 2006. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/distributionSort.html