0
[Added later – this question is not part of the original paper]
What is the worst-case time complexity of binary search on a sorted array of n elements?
- AO(n)
- BO(n log n)
- CO(log n)
- DO(1)
Correct answer: C
[Added later – this question is not part of the original paper]
What is the worst-case time complexity of binary search on a sorted array of n elements?