Problem 55530. Jump Search - 01
Find the number of leaps you need to take to find an element in an array using the jump search algorithm.
To find 16 with a jump step of 3, you follow, 2 -> 9 -> 15 -> 19 -> 17 -> 16
So, total number of jumps = 5
nb. to go forward, you take n-step jump; to go backwards, you jump only one step back.
- If the jump step is larger than the array size, u jump to the last element of the array.
Solution CommentsShow comments
Problem Recent Solvers8