Question: Problem 3 Generalized Merge Operation (34 points) Given k sorted lists, each of size n, we want to design an algorithm that will do a

Problem 3 Generalized Merge Operation (34 points) Given k sorted lists, each of size n, we want to design an algorithm that will do a k-way merge and produce one final sorted list with the elements of all of the individual lists. In other words, we want to generalize the Merge routine of MergeSort to work on k lists (not just 2). Note: You are allowed to use the Merge routine as a black box, and for running time analysis, you may assume k is a power of 2. Remember that the merge routine has a runtime of O(n) Design an efficient Divide & Conquer algorithm for this problem. What is its running time in Big O
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
