Definition: A k-way merge sort which uses three input and three output streams.
See also two-way merge sort, merge sort, balanced merge sort.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 17 December 2004.
HTML page formatted Fri Mar 25 16:20:35 2011.
Cite this as:
Art S. Kagel, "three-way merge sort", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 17 December 2004. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/threewaymsrt.html