K-way merge algorithm: Difference between revisions

Content deleted Content added
Iterative 2-Way Merge: Corrected minor typo ("and so one" → "and so on")
Line 29:
This is suboptimal.
 
The running time can be improved by iteratively merging the first with the second, the third with the fourth, and so oneon.
As the number of arrays is halved in each iteration, there are only Θ(log k) iteration.
In each iteration every element is moved exactly once.