Question 6
[10 points]
Suppose Mergesort routine is applied on the following input arrays: 5, 3, 8, 9,
1, 7, 0, 2, 6, 4. Fast forward to the moment after the two outermost recursive
calls complete, but before the final Merge step. Thinking of the two 5-element
output arrays of the recursive calls as a glued-together 10-element array, which
number is the 7th position?
Question 6
[20 points]
Define the recursive depth of Quicksort as the maximum number of successive
recursive calls it makes before hitting the base case - equivalently, the largest
level of its recursion tree. In randomized Quicksort, the recursion depth is
a random variable, depending on the pivots chosen. What is the maximum
and minimum possible recursion depths of randomized Quicksort (in Big-Oh
otation)?