(algorithm)
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 ...)
sort.
Specialization (... is a kind of me.)
bucket sort, histogram sort, linear probing sort, shuffle sort, merge sort, radix sort, UnShuffle sort, restricted universe sort, strand sort.
Note: Many distribution sorts are also merge sorts depending on how the distribution is performed.
Author: ASK
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Wed Dec 14 16:47:12 2005.
HTML page formatted Wed Dec 14 16:50:59 2005.
Cite this as:
Art S. Kagel, "distribution sort", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/distributionSort.html
