For the binarySearch method in Section 7.10.2, what is low and high after the first iteration of the while loop when invoking binarySearch (new int[]{1, 4, 6, 8, 10, 15, 20}, 11) ? A. low is 0 and high is 6B. low is 5 and high is 5C. low is 3 and high is 6D. low is 4 and high is 6E. low is 6 and high is 5

Answer D : Low is 4 and high is 6

Explanation:

Here is Function

int binarySearch (int arr[], int l, int r, int x) {

while (l < = r) {

int m = l + (r - l) / 2;

/ / Check if x is present at mid

if (arr[m] = = x)

return m;

/ / If x greater, ignore left half

if (arr[m] < x)

l = m + 1;

/ / If x is smaller, ignore right half

else

r = m - 1; }

/ / if we reach here, then element was

/ / not present

return - 1; }