mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-03-23 06:59:47 +00:00
Code Issues Packages Projects Releases Wiki Activity

Fixes #131

Browse Source
This commit is contained in:
Juan Antonio 2017-10-01 14:55:47 +02:00
parent aa8485b4df
commit 22a577b799
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, mid - 1)
else: else:
return binary_search_by_recursion(sorted_collection, item, left+1, right) return binary_search_by_recursion(sorted_collection, item, mid + 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`