balanced two-way merge sort


Definition: A balanced k-way merge sort that sorts a data stream using repeated merges. It distributes the input into two streams by repeatedly reading a block of input that fits in memory, a run, sorting it, then writing it to the next stream. It then repeatedly merges the two streams and puts each merged run into one of two output streams until there is a single sorted output.

Generalization (I am a kind of ...)
external sort.

See also merge sort, simple merge, balanced merge sort, nonbalanced merge sort, two-way merge sort.

Author: ASK

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 16 May 2005.
HTML page formatted Mon Feb 2 13:10:39 2015.

Cite this as:
Art S. Kagel, "balanced two-way merge sort", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 16 May 2005. (accessed TODAY) Available from: