make code more readable (#1304)

TheAlgorithms · Oct 8, 2019 · 0da4d0a7f35c825447aa4666bb073a3ad118f319 · 0da4d0a
1 parent 25701a9
commit 0da4d0a7f35c825447aa4666bb073a3ad118f319
Unified Split

Showing with 3 additions and 4 deletions.

+3 −4 searches/binary_search.py
diff --git a/searches/binary_search.py b/searches/binary_search.py
@@ -43,11 +43,10 @@ def binary_search(sorted_collection, item):
         current_item = sorted_collection[midpoint]
         if current_item == item:
             return midpoint
+        elif item < current_item:
+            right = midpoint - 1
         else:
-            if item < current_item:
-                right = midpoint - 1
-            else:
-                left = midpoint + 1
+            left = midpoint + 1
     return None