diff --git a/searches/jump_search.py b/searches/jump_search.py
index 10cb933f2f35..6613afa3a920 100644
--- a/searches/jump_search.py
+++ b/searches/jump_search.py
@@ -1,12 +1,44 @@
-from __future__ import print_function
-import math
+"""
+Jump search algorithm
+
+    >>> arr = [
+    ...     0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610,
+    ... ]
+
+    >>> arr[jump_search(arr, 55)]
+    55"""
+Jump search algorithm
+
+    >>> arr = [
+    ...     0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610,
+    ... ]
+
+    >>> arr[jump_search(arr, 55)]
+    55
+
+    >>> arr[jump_search(arr, 0)]
+    0
+
+    >>> arr[jump_search(arr, 610)]
+    610
+
+Check if all arr at once:
+
+    >>> all(arr[jump_search(arr, x)] == x for x in arr)
+    True
+
+"""
+
+from math import floor, sqrt
+
+
 def jump_search(arr, x):
-    n = len(arr)
-    step = int(math.floor(math.sqrt(n)))
     prev = 0
-    while arr[min(step, n)-1] < x:
+    n = len(arr)
+    step = int(floor(sqrt(n)))
+    while arr[min(step, n) - 1] < x:
         prev = step
-        step += int(math.floor(math.sqrt(n)))
+        step += int(floor(sqrt(n)))
         if prev >= n:
             return -1
 
@@ -14,13 +46,45 @@ def jump_search(arr, x):
         prev = prev + 1
         if prev == min(step, n):
             return -1
+
     if arr[prev] == x:
         return prev
+
     return -1
 
 
+    >>> arr[jump_search(arr, 0)]
+    0
+
+    >>> arr[jump_search(arr, 610)]
+    610
+
+Check if all arr at once:
+
+    >>> all(arr[jump_search(arr, x)] == x for x in arr)
+    True
 
-arr = [ 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610]
-x = 55
-index = jump_search(arr, x)
-print("\nNumber " + str(x) +" is at index " + str(index));
+"""
+
+from math import floor, sqrt
+
+
+def jump_search(arr, x):
+    prev = 0
+    n = len(arr)
+    step = int(floor(sqrt(n)))
+    while arr[min(step, n) - 1] < x:
+        prev = step
+        step += int(floor(sqrt(n)))
+        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