NIST

polyphase merge sort

(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

Implementation

(C) (Error: variable some is not initialized nor reset) using an auxiliary function to select next file (C)
Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.

Entry modified 30 September 2009.
HTML page formatted Wed Sep 30 13:22:29 2009.

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. 30 September 2009. (accessed TODAY) Available from: http://www.itl.nist.gov/div897/sqg/dads/HTML/polyphmrgsrt.html

to NIST home page