K-way merge algorithm: Difference between revisions

Revision as of 07:29, 21 November 2015

Revision as of 08:04, 21 November 2015

Line 1:

{{AFC submission|d|nn|u=Kl4bx|ns=2|decliner=SwisterTwister|declinets=20151121080412|ts=20151121072944}} <!-- Do not remove this line! -->

{{User sandbox}}

{{AFC comment|1=I'm not entirely sure what the article's title is, but this could also use any more available information and sources overall. Cheers, [[User:SwisterTwister|<font color="green">SwisterTwister</font>]] [[User talk:SwisterTwister|<font color="green">talk</font>]] 08:04, 21 November 2015 (UTC)}}

----

<!-- EDIT BELOW THIS LINE -->

Line 29 ⟶ 34:

== Ideal Merge ==

The Ideal Merge technique is another merge method for merging greater than two lists. The ideal merging technique was first discussed as a part of UnShuffle Sort.<ref>'''Art S. Kagel''', ''Unshuffle Algorithm, Not Quite a Sort?'', Computer Language Magazine, 3(11), November 1985.</ref>

Given a group of sorted lists ''S'' that we want to merge into list ''S''', the algorithm is as follows:

Line 57 ⟶ 62:

* {{cite book|author1=Thomas H Cormen|author2=Charles E Leiserson|author3=Ronald L Rivest|coauthors=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}}

{{AFC submission|||ts=20151121072944|u=Kl4bx|ns=2}}