So far I have:

- Each array k have n elements that are already sorted.

- Since they are already sorted, I can apply the merge of merge sort by merging the first array with the second, the third with the fourth...etc until all arrays have been merged.

- It is O(kn) work to merge the k arrays of size n into k/2 arrays of size 2n, then doing O(kn) work O(logn) times until there is a single array of size kn.

- Thus, run time is O(klogkn).

How would the pseudocode look for this algorithm?

Give an algorithm that gets k sorted arrays (of integers) each of size n as input, and merges them into a single sorted array. Your grade depends on the run time of your algorithm