What is the worst-case complexity of a binary search? A) O( n ²) B) O( n ) C) O(log₂ n ) D) O²

Name: What is the worst-case complexity of a binary search? A) O( n 2 ) B) O( n ) C) O(log 2 n ) D) O 2
Brand: Quizplus
Rating: 4.8 (39 reviews)

Question

Quizplus · Accepted Answer

The worst-case complexity of a binary search is O(log n), so the only suitable choice is C which represents it in the correct format. The other options have either incorrect notations or wrong time complexities.

What Is the Worst-Case Complexity of a Binary Search