(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 16 May 2005.
HTML page formatted Fri Nov 30 12:16:34 2007.
Cite this as:
Art S. Kagel, "balanced 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/balancmrgsrt.html