Question: Consider a version of MergeSort that splits an unsorted array A in 1/3 and 2/3 instead of in halves. Meaning, the left subarray should contain

Consider a version of MergeSort that splits an unsorted array A in 1/3 and 2/3 instead of in halves. Meaning, the "left" subarray should contain the first third of elements in A, and the "right" subarray should contain the remaining elements in A (a) Write pseudocode for this version of MergeSort and show the worst-case running time. (b) Is this method more efficient than splitting the array in halves? Why or why not
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
