Cascade merge sort

From Wikipedia, the free encyclopedia

Cascade merge sort is similar to the polyphase merge sort but uses a simpler distribution. The merge is slower than a polyphase merge when there are fewer than six files, but faster when there are more than six.[1]


  1. ^ Bradley 1982, pp. 189–190
  2. ^ Knuth, Donald (1998). The Art of Computer Programming (2nd ed.). Reading, Mass.: Addison Wesley. p. 288. ISBN 0201896850.

External links[edit]