(algorithm)
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.
Author: ASK
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 4 October 2007.
HTML page formatted Thu Oct 4 08:45:52 2007.
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. 4 October 2007. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/polyphmrgsrt.html