how would you sort n sorted lists with average length K in O(n*log K) time?

Question

how would you sort n sorted lists with average length K in O(n*log K) time?

Answer 1

You can adapt merge sort to do the job. Merge sort takes advantage of the ease of merging already sorted lists into a new sorted list.