Printing this content is disabled

This page is protected for print. Use the website to view the content.

Searching Algorithms Data Structure And AlgorithmMedium

Which of the following searching algorithm is fastest when the input array is sorted and has uniformly distributed values?

Correct Answer: D — interpolation search

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.