Loading practice questions
Which of the following searching algorithm is fastest when the input array is sorted and has uniformly distributed values?
Correct Answer: D — interpolation search
Explanation:
Interpolation search has a time complexity of O( log log n) when the array is sorted and has uniformly distributed values. It has the least time complexity out of the given options for such a case.