ObjectiveMcq
Print Protected
This page is protected for print. Use the website to view the content.
In which of the following case jump search performs better than interpolation search?
Correct Answer: C — when array is sorted but the values increases exponentially
In case of non uniform distribution of values the time complexity of interpolation search is O(n) whereas the average time complexity of jump search is O(n^{1/2}). So in such a case jump search has a better performance.