A ____ search starts looking in the middle of a sorted list,and then determines whether it should continue higher or lower.
A) linear
B) binary
C) quadratic
D) divided

Question

Quizplus · Accepted Answer

A binary search algorithm starts by comparing the target value to the middle element of a sorted array. If the target value is equal to the middle element, the search is complete. If the target value is less than the middle element, the search continues on the lower half of the array; if it's greater, the search continues on the upper half. This process repeats, effectively dividing the search interval in half each time, until the target value is found or the search interval is empty.

A ____ Search Starts Looking in the Middle of a Sorted