A ____ checks whether the search value is lower or higher than an element in the array, adjusting the limits of the array's searchable area with each comparison.
A) sequential search
B) selection search
C) binary search
D) repetition search

Question

Quizplus · Accepted Answer

A binary search algorithm efficiently finds the position of a target value within a sorted array by repeatedly dividing the search interval in half and determining whether the search value is in the first or second half of the interval, thus narrowing down the search area significantly with each step.

A ____ Checks Whether the Search Value Is Lower or Higher