(algorithm)
Definition: A merge sort that sorts a data stream using repeated merges. It distributes the input into k streams by repeatedly reading a block of input that fits in memory, called a run, sorting it, then writing it to the next stream. It then repeatedly merges the k streams and puts each merged run into one of j output streams until there is a single sorted output.
See also simple merge, balanced merge sort, 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:58:04 2005.
HTML page formatted Wed Oct 26 09:47:13 2005.
Cite this as:
Art S. Kagel, "balanced k-way merge sort", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/balanckwayms.html
