Continuing from Exercise 18, after part (a), a. Perform a test so that the smaller subarray is processed by the first recursive call and the larger subarray is processed by the second recursive call. ...

Continuing from Exercise 18, after part (a),

a. Perform a test so that the smaller subarray is processed by the first recursive call and the larger subarray is processed by the second recursive call.

b. Remove the tail recursion by writing a while loop and altering low or high, as necessary.

c. Prove that the number of recursive calls is logarithmic in the worst case.