Suppose that you have the following list. int[] list = {5, 10, 15, 20, 25, 30, 35, 40, 45}; Further assume that binary search is used to determine whether 20 is in list. When the loop terminates, the value of the index variable first is 3.

Question

Quizplus · Accepted Answer

In binary search, the list is divided in half repeatedly. Starting with the middle element (index 4, value 25), the search moves to the left half (indices 0 to 3) because 20 is less than 25. The next middle element is at index 1 (value 10), and since 20 is greater, the search moves to the right half (indices 2 to 3). The middle element is now at index 2 (value 15), and since 20 is greater, the search moves to index 3, where the value is 20. Thus, the index variable 'first' is 3 when the loop terminates.

Suppose That You Have the Following List