ObjectiveMcq
Print Protected
This page is protected for print. Use the website to view the content.
What is the time complexity of interpolation search when the input array has uniformly distributed values and is sorted?
Correct Answer: B — O(log log n)
Interpolation search goes to different positions in the array depending on the value being searched. It is an improvement over binary search and has a time complexity of O(log log n).