Definition: A k-way merge sort in which the number of input and output data streams is different for any particular pass. Typically P input streams are merged and distributed to T output streams on one pass followed by a merge of the T inputs and distribution to P outputs.
See also merge sort, simple merge, balanced merge sort.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 16 May 2005.
HTML page formatted Fri Feb 23 10:06:08 2018.
Cite this as:
Art S. Kagel, "nonbalanced merge sort", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 16 May 2005. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/nonbalncmsrt.html