Revision as of 03:49, 7 January 2017 edit Jennica (talk \| contribs) Extended confirmed users, Pending changes reviewers, Rollbackers 79,432 edits ->, typo(s) fixed: merged together → merged, cannonical → canonical, transfering → transferring, straight-forward → straightforward (2), a O → an O using AWB ← Previous edit		Revision as of 17:35, 3 February 2017 edit undo 2601:200:c100:4be8:d0d1:e258:1533:a921 (talk) →Iterative 2-Way Merge Next edit →
Line 40: Fortunately, in border cases the running time can be better. Consider for example the degenerate case, where all but one array contain only one element. The ~~stratedy~~strategy explained in the previous paragraph needs Θ(n log k) running time, while the improved one only needs Θ(n) running time. === Direct K-Way Merge ===

K-way merge algorithm: Difference between revisions