Match each term with a statement below.

-Starts looking in the middle of a sorted list,and then determines whether it should continue higher or lower
A)linear search
B)in bounds
C)flag
D)parallel arrays
E)array
F)element
G)for loop
H)named constant
I)binary search
J)populating the array

Question

Match each term with a statement below.

-Starts looking in the middle of a sorted list,and then determines whether it should continue higher or lower
A)linear search
B)in bounds
C)flag
D)parallel arrays
E)array
F)element
G)for loop
H)named constant
I)binary search
J)populating the array

Quizplus · Accepted Answer

Binary search algorithm starts by comparing the middle element of a sorted array with the target value. If the target value matches 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 the target value is greater, the search continues on the upper half. This process repeats until the target value is found or the subarray narrows down to zero size.

Match Each Term with a Statement Below