Cascade merge sort
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[]
- ^ Bradley 1982, pp. 189–190
- Bradley, James (1982), File and Data Base Techniques, Holt, Rinehart and Winston, ISBN 0-03-058673-9
External links[]
Categories:
- Sorting algorithms
- Comparison sorts
- Stable sorts