Oscillating merge sort: Difference between revisions

Revision as of 10:32, 18 December 2019

Revision as of 04:49, 27 November 2020

Line 6:

{{Reflist}}

*{{Citation |last=Bradley |first=James |year=1982 |title=File and Data Base Techniques |publisher=Holt, Rinehart and Winston |isbn=0-03-058673-9 |doi= |url-access=registration |url=https://archive.org/details/filedatabasetech0000brad }}

==Further reading==

*{{Citation |last=Flores |first=Ivan |year=1969 |title=Computer Sorting |publisher=Prentice-Hall |isbn=978-0-13165746-5 |doi= |ref=none}}

*{{Citation |last=Knuth |first=D. E. |year=1975 |title=Sorting and Searching |series=[[The Art of Computer Programming]] |volume=3 |publisher=Addison Wesley |isbn= |doi= |ref=none}}

*{{Citation |last=Lowden |first=B. G. T. |title=A note on the oscillating sort |journal=The Computer Journal |volume=20 |issue=1 |page=92 |date= |url=http://comjnl.oxfordjournals.org/content/20/1/92.full.pdf |doi= 10.1093/comjnl/20.1.92 |ref=none}}

*{{Citation |last=Martin |first=W. A. |year=1971 |title=Sorting |journal=Computing Surveys |publisher=ACM |doi= |ref=none}}

*{{Citation |last=Sobel |first=Sheldon |title=Oscillating Sort–A New Sort Merging Technique |journal=Journal of the ACM |publisher=ACM |___location=New York, NY |volume=9 |issue=3 |pages=372–374 |date=July 1962 |doi=10.1145/321127.321133 |ref=none}}