Merge algorithm: Difference between revisions

Revision as of 04:52, 13 November 2012

Revision as of 04:53, 13 November 2012

Line 20:

[[Python (programming language)]]'s standard library (since 2.6) also has a <code>merge()</code> function in the <code>heapq</code> module, that takes multiple sorted iterables, and merges them into a single iterator.<ref>http://docs.python.org/library/heapq.html#heapq.merge</ref>

==Parallel Mergemerge==

In [[parallel computing]], [[Array data structure|array]]s of sorted values may be merged efficiently using an [[all nearest smaller values]] computation.<ref>{{citation |first1=Omer |last1=Berkman |first2=Baruch |last2=Schieber |first3=Uzi |last3=Vishkin |author3-link=Uzi Vishkin |title=Optimal double logarithmic parallel algorithms based on finding all nearest smaller values |journal=Journal of Algorithms |volume=14 |pages=344–370 |year=1993 |issue=3 |doi=10.1006/jagm.1993.1018}}</ref>