mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-03-20 05:29:48 +00:00
Code Issues Packages Projects Releases Wiki Activity

make code more readable (#1304)

Browse Source
This commit is contained in:
Du YuanChao 2019-10-08 16:22:40 +08:00 committed by Christian Clauss
parent 25701a9877
commit 0da4d0a7f3
1 changed files with 3 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
searches/binary_search.py
View File

@ -43,11 +43,10 @@ def binary_search(sorted_collection, item):
current_item = sorted_collection[midpoint] current_item = sorted_collection[midpoint]
if current_item == item: if current_item == item:
return midpoint return midpoint
elif item < current_item:
right = midpoint - 1
else: else:
if item < current_item: left = midpoint + 1
right = midpoint - 1
else:
left = midpoint + 1
return None return None