ObjectiveMcq
Print Protected
This page is protected for print. Use the website to view the content.
What will be the maximum number of comparisons that can be made in jump search algorithm (assuming k to be blocks jumped)?
Correct Answer: C — k-1
Worst case occurs when the element being searched is present just after the element that has been compared while making the last jump. So, in this case k-1 comparisons will have to be made.