Q55
What is the time complexity of exponential search when the input array is sorted but the values are not uniformly distributed?
A.
O(n1/2)
B.
O(log log n)
C.
O(n)
AnswerD.
O(log n)
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board