Q37
Which searching algorithm has a time complexity of O(log n) in the worst case?
A.
Linear Search
B.
Jump Search
C.
Binary Search
AnswerD.
Interpolation Search
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board