Revision as of 04:00, 8 June 2016 edit 2602:306:3ae4:82b0:ac28:d012:3a68:5a7f (talk) than -> then ← Previous edit		Revision as of 10:10, 22 October 2016 edit undo Bender the Bot (talk \| contribs) Bots 1,064,377 edits m →Further reading: http→https for Google Books and Google News using AWB 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\|author4=Clifford Stein\|title=Introduction To Algorithms\|url=~~http~~https://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