0 0 votes Give an $O(n\lg\ k)$- time algorithm to merge $k$ sorted lists into one sorted list, where $n$ is the total number of elements in all the input lists. (Hint: Use a minheap for $k$-way merging.) Algorithms cormen algorithms binary-heap descriptive + – akash.dinkar12 472 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
