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][2]
References
- ^ Bradley 1982, pp. 189–190
- ^ Knuth, Donald (1998). The Art of Computer Programming (2nd ed.). Reading, Mass.: Addison Wesley. p. 288. ISBN 0201896850.
- Bradley, James (1982), File and Data Base Techniques, Holt, Rinehart and Winston, ISBN 0-03-058673-9
External links
- http://www.minkhollow.ca/Courses/461/Notes/Cosequential/Cascade.html
- v
- t
- e
Sorting algorithms
- Computational complexity theory
- Big O notation
- Total order
- Lists
- Inplacement
- Stability
- Comparison sort
- Adaptive sort
- Sorting network
- Integer sorting
- X + Y sorting
- Transdichotomous model
- Quantum sort
- Bubble sort
- Cocktail shaker sort
- Odd–even sort
- Comb sort
- Gnome sort
- Proportion extend sort
- Quicksort
- Selection sort
- Heapsort
- Smoothsort
- Cartesian tree sort
- Tournament sort
- Cycle sort
- Weak-heap sort
- Insertion sort
- Shellsort
- Splaysort
- Tree sort
- Library sort
- Patience sorting
- Merge sort
- Cascade merge sort
- Oscillating merge sort
- Polyphase merge sort
- American flag sort
- Bead sort
- Bucket sort
- Burstsort
- Counting sort
- Interpolation sort
- Pigeonhole sort
- Proxmap sort
- Radix sort
- Flashsort
Cascade_merge_sort