Q111
What is the time complexity of interpolation search when the input array has uniformly distributed values and is sorted?
A.
O(n)
B.
O(log log n)
AnswerC.
O(n log n)
D.
O(log n)
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board