In the worst case,a binary search is ______.
A)O(n)
B)O(1)
C)O(log2ⁿ)
D)O(n²)

Name: In the worst case,a binary search is ______. A)O(n) B)O(1) C)O(log2ⁿ) D)O(n²)
Brand: Quizplus
Rating: 4.9 (31 reviews)

Question

Quizplus · Accepted Answer

Binary search has a time complexity of O(log2ⁿ) in the worst case scenario, as it eliminates half of the remaining possibilities with each comparison. This is a very efficient time complexity and is considered one of the fastest search algorithms. Therefore, the best choice is C.

In the Worst Case,a Binary Search Is ______