Suppose that L is a list of 11 elements and it is sorted using the merge sort algorithm. (12)
a. What are the sizes of the first and second sublists after the first execution of the function divide?
b. How many times is the function divide called to sort L?
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.