ObjectiveMcq
Print Protected
This page is protected for print. Use the website to view the content.
What is the time complexity of exponential search when the input array is sorted but the values are not uniformly distributed?
Correct Answer: C — O(n)
When an array has non uniformly distributed values then in that case the algorithm of interpolation search fails to work efficiently. As a result, it has a time complexity of O(n) in such a case.