Question: Problem 1.2 Consider the following modification to the MergeSort algorithm: divide the input array into thirds (rather than halves) recursively sort each third, and finally

Problem 1.2 Consider the following modification to the MergeSort algorithm: divide the input array into thirds (rather than halves) recursively sort each third, and finally combine the results using a three-way Merge subroutine. What is the running time of this algorithm as a function of the length n of the input array, ignoring constant factors and lower-order terms? Hint: Note that the Merge subrontine can still be implemented so that the number of operations is only linear in the sum of the input array lengths.] a) n b) nlog n e) nilog n)? d) ne log n
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
