ObjectiveMcq
Print Protected
This page is protected for print. Use the website to view the content.
Interpolation search has a better time complexity than exponential search for any given array.
Correct Answer: B — False
The worst case time complexity of interpolation search and exponential search are O(n) and O(log n) respectively. So exponential search is better when the worst case scenario is considered.