ObjectiveMcq
Print Protected
This page is protected for print. Use the website to view the content.
What is the value of jump taken for maximum efficiency while implementing jump search?
Correct Answer: C — n^{1/2}
Total number of comparisons required will be n/k + k-1 in worst case. This function will be minimum for k=n^{1/2}. So this value of jump will be the best for implementing jump search.