2018-10-12 19:37:13 +00:00
---
title: Jump Search
---
## Jump Search
2018-12-14 04:33:29 +00:00
2018-11-12 15:52:49 +00:00
A jump search locates an item in a sorted array by jumping k items in the array and then verifies if the item wanted is between the previous jump and current jump.
2018-10-12 19:37:13 +00:00
2018-11-12 15:52:49 +00:00
# Worst Case Complexity
2018-10-12 19:37:13 +00:00
O(√N)
2018-11-12 15:52:49 +00:00
# How does it work ?
1. Define the value of k, the number of jumps: The optimal jump size is √N where N is the length of the sorted array.
2. Jump over the array elements by k everytime, checking the following condition `Array[i] < valueWanted < Array[i+k]` .
3. If the previous condition is true, then do a linear search between `Array[i]` and `Array[i + k]` .
4. Return the position of the value if it is found in the array.
2018-10-12 19:37:13 +00:00
![Jumping Search 1 ](https://i1.wp.com/theoryofprogramming.com/wp-content/uploads/2016/11/jump-search-1.jpg?resize=676%2C290 )
# Code
2018-11-12 15:52:49 +00:00
To view examples of code implementation for this method, access this link below:
2018-10-12 19:37:13 +00:00
2018-12-14 04:33:29 +00:00
[Jump Search - OpenGenus/cosmos ](https://github.com/OpenGenus/cosmos/tree/master/code/search/src/jump_search )
2018-10-12 19:37:13 +00:00
# Credits
[The logic's array image ](http://theoryofprogramming.com/2016/11/10/jump-search-algorithm/ )