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 Black.

Entry modified 12 February 2019.
HTML page formatted Mon May 11 15:07:57 2026.

Cite this as:
Art S. Kagel, "polyphase merge sort", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 12 February 2019. (accessed TODAY) Available from: /HTML/polyphmrgsrt.html