Revision as of 00:06, 1 November 2014 edit 24.189.56.184 (talk) →C# ← Previous edit		Revision as of 00:06, 1 November 2014 edit undo ClueBot NG (talk \| contribs) Bots, Pending changes reviewers, Rollbackers 6,478,334 edits m Reverting possible vandalism by 24.189.56.184 to version by Jp harris2008. False positive? Report it. Thanks, ClueBot NG. (2013108) (Bot) Next edit →
Line 25: === C# === In [[CSharp\|C#]], merge can be achieved with [[Language Integrated Query\|LINQ]]. ~~-- snektal~~ ~~Linq allows you to merge distinct values only though~~ ==Parallel merge== 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>

Merge algorithm: Difference between revisions