A computer is performing a binary search on the sorted list of 7 numbers below. What is the maximum number of iterations needed to find the item?

[1, 5, 20, 50, 51, 80, 99]

A. 1

B. 3

C. 6

D. 7

B

Explanation:

Binary search will start in the middle of the list, find which side the value is at, then look at the middle of those values.  This is incredibly efficient for larger values (Although it needs to be sorted) and practical in many instances.  Let's say that the desired number is 1, the binary search would look at "50" first, then proceed to compare with "5" and finally on it's third iteration, pick 1.

i think its controle not shift