Definition: A merge sort algorithm that reduces the number of intermediate files needed by reusing emptied files.
See also polyphase merge, sort, distribution sort, merge.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 16 November 2009.
HTML page formatted Tue Dec 6 16:16:32 2011.
Cite this as:
Art S. Kagel, "polyphase merge sort", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 16 November 2009. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/polyphmrgsrt.html