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.
For example,
a=[ 2,5,6,9,12,14,15,16,17,19,31]
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 Stats
Problem Comments
-
4 Comments
Show
1 older comment
William
on 29 Sep 2022
In my opinion, Test 3 has an incorrect answer. It should be y_correct=0, because no jumps are required when the target is the first element in the list.
Asif Newaz
on 29 Sep 2022
thanks william. it has been fixed
Dyuman Joshi
on 29 Sep 2022
Asif, Can you explain test cases #4 and #5?
Asif Newaz
on 30 Sep 2022
@Dyuman Joshi
If the jump step is larger than the array size, u jump to the last element of the array. (the problem definition is updated accordingly)
Solution Comments
Show commentsProblem Recent Solvers8
Suggested Problems
-
8256 Solvers
-
375 Solvers
-
359 Solvers
-
127 Solvers
-
76 Solvers
More from this Author165
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!