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.{{harvnb|Bradley|1982|pp=189–190}}{{cite book |last1=Knuth |first1=Donald |title=The Art of Computer Programming |date=1998 |publisher=Addison Wesley |location=Reading, Mass. |isbn=0201896850 |page=288 |edition=2nd}}
References
{{Reflist}}
- {{Citation |last=Bradley |first=James |year=1982 |title=File and Data Base Techniques |publisher=Holt, Rinehart and Winston |isbn=0-03-058673-9 |url-access=registration |url=https://archive.org/details/filedatabasetech0000brad }}
External links
- http://www.minkhollow.ca/Courses/461/Notes/Cosequential/Cascade.html
{{sorting}}