To find a value in an ordered array of 50 items, how many values must binary search examine at most.
A) 1
B) 6
C) 10
D) 25
E) 50

Question

Quizplus · Accepted Answer

Binary search operates by dividing the search interval in half each time. For an array of 50 items, the maximum number of values it needs to examine to find a value or conclude it's not present is $\log_2{50}$, which is approximately 5.64. This rounds up to 6, making option B correct.

To Find a Value in an Ordered Array of 50