Revision as of 13:11, 29 November 2015 edit Qwertyus (talk \| contribs) Extended confirmed users 31,640 edits {{sorting}} ← Previous edit		Revision as of 13:12, 29 November 2015 edit undo Qwertyus (talk \| contribs) Extended confirmed users 31,640 edits m →K-way merging Next edit →
Line 16: </div> [[Best, worst and average case\|In the worst case]], this algorithm performs {{math\|(''k''−1)(''n''−{{sfrac\|''k''/\|2}})}} element comparisons to perform its work if there are a total of {{mvar\|n}} elements in the sequences in total.<ref name="greene">{{cite conference \|last=Greene \|first=William A. \|year=1993 \|title=k-way Merging and k-ary Sorts \|conference=Proc. 31-st Annual ACM Southeast Conf \|pages=127–135}}</ref> It can be improved by storing the sequences in a [[priority queue]] ([[heap (data structure)\|min-heap]]) keyed by their first element:

Merge algorithm: Difference between revisions