Suppose that you have the following list. int[] list = {1, 3, 5, 7, 9, 11, 13, 15, 17}; Further assume that binary search is used to determine whether 8 is in list. When the loop terminates, the value of the index variable first is 1.

Question

Quizplus · Accepted Answer

Binary search will first check the middle element (9 at index 4), then move to the left half (elements 1, 3, 5, 7) and check the middle of that segment (5 at index 2), then move to the right half of that segment (elements 7) and check the middle (7 at index 3). The loop terminates when the search range is invalid, with 'first' being 4.

Suppose That You Have the Following List