Definition: A k-way merge sort in which the number of input and output data streams is the same. See balanced k-way merge sort.
See also merge sort, simple merge, nonbalanced merge sort.
Note: This is an external sort.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 16 November 2009.
HTML page formatted Mon Feb 2 13:10:39 2015.
Cite this as:
Art S. Kagel, "balanced merge sort", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 16 November 2009. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/balancmrgsrt.html