Oscillating merge sort: Difference between revisions

Browse history interactively

← Previous edit

Content deleted Content added

VisualWikitext

Revision as of 15:47, 27 September 2016 edit 82.1.230.15 (talk) Added a reference link to a source code available on GitHub. Tag: Visual edit ← Previous edit		Latest revision as of 05:23, 30 January 2025 edit undo GreenC bot (talk \| contribs) Bots 3,068,809 edits Reformat 1 archive link. Wayback Medic 2.5 per Category:All articles with dead external links - pass 6
(8 intermediate revisions by 7 users not shown)
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 }} {{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=Flores \|first=Ivan \|year=1969 \|title=Computer Sorting \|publisher=Prentice-Hall \|isbn=978-0-13165746-5 \|~~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}}▼ {{Citation \|last=~~Martin~~Knuth \|first=WD. AE. \|year=~~1971~~1975 \|title=Sorting and Searching \|~~journal~~series=~~Computing~~[[The ~~Surveys~~Art of Computer Programming]] \|~~publisher~~volume=~~ACM~~3 \|~~doi~~publisher=Addison Wesley \|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\|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–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 \|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 ▲*{{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 }} {{sorting}} <!-- [[Category:Articles with example pseudocode]] --> ~~[[Category:Sorting algorithms]]~~ [[Category:Comparison sorts]] [[Category:Stable sorts]]