Q18
What is the best-case time complexity of binary search when the target element is at the middle?
A.
O(n)
B.
O(1)
AnswerC.
O(n log n)
D.
O(n)
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board