A binary search begins with the __________ element of an array.
A) first
B) last
C) largest
D) middle
E) None of these

Question

Quizplus · Accepted Answer

In a binary search, the algorithm first compares the target value to the middle element of the sorted array. If it matches, the search is successful. If the target value is less than the middle element, the search continues on the lower half of the array. Otherwise, the search continues on the upper half of the array. Therefore, the binary search begins with the middle element of the array.

A Binary Search Begins with the __________ Element of an Array