(algorithm)
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.
Author: ASK
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 17 December 2004.
HTML page formatted Mon Feb 2 13:10:40 2015.
Cite this as:
Art S. Kagel, "three-way merge sort", in
Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 17 December 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/threewaymsrt.html