If the item being searched for is not in the array, binary search stops looking for it and reports that it is not there when
A) array index first array index last.
B) Boolean variable found equals false.
C) Boolean variable found equals True.
D) it finds a value larger than the search key.
E) it has examined all the elements in the array.

Question

If the item being searched for is not in the array, binary search stops looking for it and reports that it is not there when
A) array index first > array index last.
B) Boolean variable found equals false.
C) Boolean variable found equals True.
D) it finds a value larger than the search key.
E) it has examined all the elements in the array.

Quizplus · Accepted Answer

Binary search uses the principle of divide and conquer to search for an item in an array. If the item being searched for is not in the array, the search ends when the upper index (array index last) becomes less than the lower index (array index first). This means that the search has narrowed down to a subarray with zero elements, indicating that the item is not in the array. Therefore, option A is the correct choice.

If the Item Being Searched for Is Not in the Array