Question
What is the length of the step in jump search?
Answer: Option C
Was this answer helpful ?
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).
Was this answer helpful ?
More Questions on This Topic :
Question 1. Select the code snippet for Jump Search. ....
Question 6. How can Jump Search be improved?
....
Latest Videos
Latest Test Papers
Submit Solution