(algorithm)
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.
Author: ASK
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Mon May 16 10:57:38 2005.
HTML page formatted Wed Oct 26 09:47:13 2005.
Cite this as:
Art S. Kagel, "balanced merge sort", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/balancmrgsrt.html
