Python/searches/jump_search.py

27 lines
583 B
Python
Raw Normal View History

2017-10-12 09:10:15 +00:00
import math
2019-10-05 05:14:13 +00:00
2017-10-12 09:10:15 +00:00
def jump_search(arr, x):
n = len(arr)
step = int(math.floor(math.sqrt(n)))
2017-10-12 09:10:15 +00:00
prev = 0
2019-10-05 05:14:13 +00:00
while arr[min(step, n) - 1] < x:
2017-10-12 09:10:15 +00:00
prev = step
step += int(math.floor(math.sqrt(n)))
2017-10-12 09:10:15 +00:00
if prev >= n:
return -1
while arr[prev] < x:
prev = prev + 1
if prev == min(step, n):
return -1
if arr[prev] == x:
return prev
return -1
2019-10-05 05:14:13 +00:00
arr = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610]
2017-10-12 09:10:15 +00:00
x = 55
index = jump_search(arr, x)
2019-10-05 05:14:13 +00:00
print("\nNumber " + str(x) + " is at index " + str(index))