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

↑Jump back a section

External links

http://www.minkhollow.ca/Courses/461/Notes/Cosequential/Cascade.html

v t e Sorting algorithms

Theory	Computational complexity theory Big O notation Total order Lists Stability Comparison sort Adaptive sort Sorting network Integer sorting

Exchange sorts	Bubble sort Cocktail sort Odd–even sort Comb sort Gnome sort Quicksort Stooge sort Bogosort

Selection sorts	Selection sort Heapsort Smoothsort Cartesian tree sort Tournament sort Cycle sort

Insertion sorts	Insertion sort Shellsort Tree sort Library sort Patience sorting

Merge sorts	Merge sort Cascade merge sort Oscillating merge sort Polyphase merge sort Strand sort

Distribution sorts	American flag sort Bead sort Bucket sort Burstsort Counting sort Pigeonhole sort Proxmap sort Radix sort Flashsort

Concurrent sorts	Bitonic sorter Batcher odd–even mergesort Pairwise sorting network

Hybrid sorts	Timsort Introsort Spreadsort UnShuffle sort JSort

Other	Topological sorting Pancake sorting Spaghetti sort

↑Jump back a section

Read in another language

This page is available in 1 language

Српски / srpski

Last modified on 17 August 2012, at 20:40