From 8f71b309953fec9da78ef64ea8cc2e7314ec1b6f Mon Sep 17 00:00:00 2001 From: TaylorL19 Date: Tue, 10 Oct 2017 11:57:16 -0500 Subject: [PATCH] Fixed binary search to correctly recurse to left half and right half --- searches/binary_search.py | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/searches/binary_search.py b/searches/binary_search.py index 13b54f498..8dc3008da 100644 --- a/searches/binary_search.py +++ b/searches/binary_search.py @@ -110,9 +110,9 @@ def binary_search_by_recursion(sorted_collection, item, left, right): if sorted_collection[midpoint] == item: return midpoint 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: - 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): """Check if collection is sorted, if not - raises :py:class:`ValueError`