mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-11-28 07:21:07 +00:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #155 from TaylorL19/master

Browse Source 
Fixed binary search to correctly recurse to left half and right half
This commit is contained in:
Chetan Kaushik 2017-10-10 23:05:25 +05:30 committed by GitHub
commit a3b72c5fd3
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
searches/binary_search.py
View File

@ -110,9 +110,9 @@ def binary_search_by_recursion(sorted_collection, item, left, right):
if sorted_collection[midpoint] == item: if sorted_collection[midpoint] == item:
return midpoint return midpoint
elif sorted_collection[midpoint] > item: elif sorted_collection[midpoint] > item:
return binary_search_by_recursion(sorted_collection, item, left, right-1) return binary_search_by_recursion(sorted_collection, item, left, midpoint-1)
else: else:
return binary_search_by_recursion(sorted_collection, item, left+1, right) return binary_search_by_recursion(sorted_collection, item, midpoint+1, right)
def __assert_sorted(collection): def __assert_sorted(collection):
"""Check if collection is sorted, if not - raises :py:class:`ValueError` """Check if collection is sorted, if not - raises :py:class:`ValueError`