Consider the following list.list = {5, 11, 25, 28, 45, 78, 100, 120, 125};Suppose that binary search as discussed in the book is used to determine whether 110 is in list. What are the values of first and last when the while loop, in the body of the binarySearch method, terminates?
A) first = 6, last = 6
B) first = 6, last = 7
C) first = 7, last = 6
D) None of these

Question

Quizplus · Accepted Answer

Binary search starts with the whole list and repeatedly divides the search interval in half. If the search value is less than the item in the middle of the interval, it narrows the interval to the lower half, otherwise to the upper half. For the given list and search value of 110, the search would narrow down to the interval between indexes 7 (value 120) and 6 (value 100), where first (the start of the search interval) becomes 7 and last (the end of the search interval) becomes 6, indicating that the value 110 is not in the list and the search interval is empty.

Consider the Following List