Using a binary search, what is the maximum number of comparisons required to find a search key in a 31-element sorted array?
A) 4.
B) 5.
C) 32.
D) 1.

Question

Quizplus · Accepted Answer

Using binary search, the maximum number of comparisons required to find a search key in a sorted array of n elements is log2(n). In this case, log2(31) ≈ 4.95, which rounds up to 5. Therefore, the maximum number of comparisons required is 5.

Using a Binary Search, What Is the Maximum Number of Comparisons