Question: 1. [Sorting Algorithms] (i) Let T(n) denote the running time of MergeSort on an input of size n. What is the recurrence equation for T(n)?
![1. [Sorting Algorithms] (i) Let T(n) denote the running time of](https://dsd5zvtm8ll6.cloudfront.net/si.experts.images/questions/2024/09/66f53942dc2da_01066f539425236b.jpg)
1. [Sorting Algorithms] (i) Let T(n) denote the running time of MergeSort on an input of size n. What is the recurrence equation for T(n)? [3 Marks] ii) Solve this recurrence equation to obtain the running time for MergeSort on an input of size n. What is its running time? [7 Marks]
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
