K-way merge algorithm: Difference between revisions

Revision as of 22:21, 19 December 2016

Revision as of 22:09, 5 January 2017

Line 10:

Initially, these indices refer to the first element, i.e., are 1.

If A[i] < B[j], then the algorithm copies A[i] into C[k] and increases i and k.

Otherwise, the algorithm copies B[j] into C[k] and increases ij and k.

A special case arises if either i or j have reached the end of A or B.

In this case the algorithm copies the remaining elements of B or A into C and terminates.