Question

Consider the following method, which implements a recursive binary search.

Answer 1

Answer:

D. low = 2, high = 1

Explanation:

Middle is 2

First call: low = 0 high = 1

Middle is 0

Second call: low = 1 high = 1

Middle is 2

Third call: low = 2 high = 1