If the list in the accompanying figure was to be searched for the number 44 using a binary search, how many key comparisons would have to be made?
A) 1
B) 3
C) 5
D) 7

Question

Quizplus · Accepted Answer

In a binary search, the list is repeatedly divided in half. Assuming the list is sorted, it takes log2(n) comparisons to find an element. For a list of 32 elements, it would take at most 5 comparisons.

If the List in the Accompanying Figure Was to Be