K-way merge

Suppose you are give \(k\) sorted arrays each of \(n\) elements. Using the standard merge subroutine you merge the first 2 arrays and merge the 3rd array to the already merged arrays, and so on until you merge the \(k\)-th array, what is the running time of this procedure?

×

Problem Loading...

Note Loading...

Set Loading...