NIST

distribution sort

(algorithm)

Definition: Any sort algorithm where items are distributed from the 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, 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.

Author: ASK


Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 28 November 2014.
HTML page formatted Fri Feb 23 10:06:07 2018.

Cite this as:
Art S. Kagel, "distribution sort", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 28 November 2014. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/distributionSort.html