ObjectiveMcq
Print Protected
This page is protected for print. Use the website to view the content.
What is the length of the step in jump search?
Correct Answer: C — sqrt(n)
If the step size is 1, it becomes a linear search, if it is n, we reach the end of the list in just on step, if it is n/2, it becomes similar to binary search, therefore the most efficient step size is found to be sqrt(n).