Oscillating merge sort: Difference between revisions

Revision as of 00:45, 16 August 2012

Latest revision as of 05:23, 30 January 2025

(14 intermediate revisions by 11 users not shown)

Line 1:

'''Oscillating merge sort''' or '''oscillating sort''' is a variation of [[merge sort]] used with tape drives that can read backwards. Instead of doing a complete distribution as is done in a tape merge, the distribution of the input and the merging of runs are interspersed. The oscillating merge sort does not waste rewind time or have tape drives sit idle as in the conventional tape merge.

The oscillating merge sort "was designed for tapes that can be read backward and is more efficient geerallygenerally than either the [[Polyphase merge sort|polyphase]] or [[Cascade merge sort|cascade]] merges."<ref>{{harvnb|Bradley|1982|p=190}}</ref>

==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 |doiurl-access=registration |url=https://archive.org/details/filedatabasetech0000brad }}

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

==Further reading==

*{{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= }}

*{{Citation |last=LowdenFlores |first=B. G. T.Ivan |titleyear=A note on the oscillating sort1969 |journaltitle=The Computer JournalSorting |volumepublisher=20Prentice-Hall |issueisbn=1978-0-13165746-5 |pageref=92 |date= |url=http://comjnl.oxfordjournals.org/content/20/1/92.full.pdf |doi= none}}

*{{Citation |last=MartinKnuth |first=WD. AE. |year=19711975 |title=Sorting and Searching |journalseries=Computing[[The SurveysArt of Computer Programming]] |publishervolume=ACM3 |doipublisher=Addison Wesley |ref=none}}

*{{Citation |last=SobelLowden |first=SheldonB. G. T. |title=Oscillating Sort&ndash;A Newnote Sort Merging Technique |journal=Journal ofon the ACMoscillating |publisher=ACMsort |___locationjournal=NewThe York,Computer NYJournal |volume=920 |issue=31 |pagespage=372&ndash;37492 |dateurl=July 1962http://comjnl.oxfordjournals.org/content/20/1/92.full.pdf |doi= 10.11451093/321127comjnl/20.3211331.92 |ref=none|doi-access=free }}{{dead link|date=January 2025|bot=medic}}{{cbignore|bot=medic}}

*{{Citation |last=Martin |first=W. A. |year=1971 |title=Sorting |journal=Computing Surveys |volume=3 |issue=4 |pages=147–174 |publisher=ACM |doi=10.1145/356593.356594 |ref=none|doi-access=free }}

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

==External links==

*Mihaldinecz, Maximilian (2016), "[https://github.com/MaximilianMihaldinecz/oscillating-merge-sort A variation of Oscillating Merge Sort implemented in Matlab]", GitHub

{{sorting}}

<!-- [[Category:Articles with example pseudocode]] -->

[[Category:Sorting algorithms]]

[[Category:Comparison sorts]]

[[Category:Stable sorts]]