balanced merge sort


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


(C) using an auxiliary function to select next file (C).
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 12 February 2019.
HTML page formatted Wed Mar 13 12:42:45 2019.

Cite this as:
Art S. Kagel, "balanced merge sort", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 12 February 2019. (accessed TODAY) Available from: