The Average-case Time Complexity of the binary search algorithm is-

The Average-case Time Complexity of the binary search algorithm is-

  1. a) O(n/2 log n)
  2. b) O(n log n)
  3. c) O(log n)
  4. d) O(1)

From the Combined Bank Senior Officer September 2021 – Preliminary (AUST) exam, question 31 of 92.

More from this paper