Revision as of 03:17, 23 February 2016 edit 98.232.174.86 (talk) →Applying 2-Way Merge when k > 2: There are k lists to merge, not m. ← Previous edit		Revision as of 12:19, 23 April 2016 edit undo Sietse Snel (talk \| contribs) Extended confirmed users 9,930 edits m →Further reading: fix deprecated reference syntax and add author links for reference Next edit →
Line 63: == Further reading == * {{cite book\| last = Knuth\| first = Donald\| authorlink = Donald Knuth\| series = [[The Art of Computer Programming]]\| volume= 3\| title= Sorting and Searching\| edition = 2nd\| publisher = Addison-Wesley\| year= 1998\| chapter = Section 5.2.4: Sorting by Merging\| pages = 158–168\| isbn = 0-201-89685-0\| ref = harv}} * {{cite book\|author1=Thomas H. Cormen\|authorlink1=Thomas H. Cormen\|author2=Charles E. Leiserson\|author3=Ronald L. Rivest\|authorlink3=Ron Rivest\|~~coauthors~~author4=Clifford Stein\|title=Introduction To Algorithms\|url=http://books.google.com/books?id=NLngYyWFl_YC&pg=PA11\|year=2001\|publisher=MIT Press\|isbn=978-0-262-03293-3\|pages=28–29}} [[Category:Sorting algorithms]]

K-way merge algorithm: Difference between revisions