Question: 4. (15 points) Recall the pseudo-code for MergeSort: // Algorithm MergeSort (A [1...n]) // Input: An array A[1...n] if n=1 return 1 else B [1...n/2]

4. (15 points) Recall the pseudo-code for MergeSort: // Algorithm MergeSort (A [1...n]) // Input: An array A[1...n] if n=1 return 1 else B [1...n/2] C[1...n/2] Merge (B, C) MergeSort (A [1...n/2]) MergeSort (A [n/2+1...n]) Remember that merging two sorted arrays B and C into one sorted array costs n time. Now Set up a recurrence relation for the algorithm's running time and solve it
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
