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 Black.
Entry modified 12 February 2019.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Art S. Kagel, "polyphase merge sort", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 12 February 2019. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/polyphmrgsrt.html