Revision as of 13:09, 29 November 2015 edit Qwertyus (talk \| contribs) Extended confirmed users 31,640 edits m →C++: {{mono}} ← Previous edit		Revision as of 13:11, 29 November 2015 edit undo Qwertyus (talk \| contribs) Extended confirmed users 31,640 edits {{sorting}} Next edit →
Line 77: * [[Donald Knuth]]. ''[[The Art of Computer Programming]]'', Volume 3: ''Sorting and Searching'', Third Edition. Addison-Wesley, 1997. ISBN 0-201-89685-0. Pages 158–160 of section 5.2.4: Sorting by Merging. Section 5.3.2: Minimum-Comparison Merging, pp. 197–207. *{{Citation \|first1=Thomas \|last1=Cormen \|authorlink1=Thomas H. Cormen \|first2=Charles \|last2=Leiserson \|authorlink2=Charles E. Leiserson \|first3=Ronald \|last3=Rivest \|authorlink3=Ronald L. Rivest \|first4=Clifford \|last4=Stein \|authorlink4=Clifford Stein \|title=[[Introduction to Algorithms]] \|edition=Third \|publisher=MIT Press and McGraw-Hill \|year=2009 \|isbn=978-0-262-03384-8 \|chapter=Section 27.3: Multithreaded merge sort \|pages=797–804 }} {{sorting}} {{DEFAULTSORT:Merge Algorithm}}

Merge algorithm: Difference between revisions