Cascade merge sort

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

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]

References[edit]

  1. ^ Bradley 1982, pp. 189–190
  • Bradley, James (1982), File and Data Base Techniques, Holt, Rinehart and Winston, ISBN 0-03-058673-9

External links[edit]