Ask Question

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

+1
Answers (1)
  1. 24 September, 20:43
    0
    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; }
Know the Answer?
Not Sure About the Answer?
Find an answer to your question 👍 “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 ...” in 📗 Computers & Technology if the answers seem to be not correct or there’s no answer. Try a smart search to find answers to similar questions.
Search for Other Answers