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 E. Black.
Entry modified 16 May 2005.
HTML page formatted Fri Mar 25 16:20:34 2011.
Cite this as:
Art S. Kagel, "nonbalanced merge sort", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 16 May 2005. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/nonbalncmsrt.html