Binary search does ____ comparisons in the worst case.
A) Θ(1)
B) Θ(lg n)
C) Θ(n)
D) Θ(n2)

Name: Binary search does ____ comparisons in the worst case. A) Θ(1) B) Θ(lg n) C) Θ(n) D) Θ(n2)
Brand: Quizplus
Rating: 4.9 (39 reviews)

Question

Quizplus · Accepted Answer

Binary search halves the search space in each iteration. In the worst case, we will have to keep dividing the search space until there is only one element left, which takes log n iterations. Therefore, the worst-case time complexity of binary search is O(log n), which is Option B.

Binary Search Does ____ Comparisons in the Worst Case