Question Detail
Question
What is the worst-case time complexity of binary search on a sorted array containing n items?
Correct Answer
Option A is the correct answer.
Detailed Explanation
Because the search domain is halved with every step, the worst-case number of comparisons is proportional to log2(n).
Hint
No hint available