Question: (a) Write pseudo code the merge sort algorithm, explaining clearly the different parts of your code. (b) What is the asymptotic time complexity of the

(a) Write pseudo code the merge sort algorithm, explaining clearly the different parts of your code. (b) What is the asymptotic time complexity of the merge sort algorithm? Write a recurrence relation for expressing the time complexity of the merge sort algorithm You need not solve it. Simulate the algorithm you have written in part (a) on the following e array for sorting it in ascending order: 9, 8, 7, 6, 5, 4, 3, 2
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
