mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-01-30 14:13:44 +00:00
Code Issues Packages Projects Releases Wiki Activity

fix doctests for recursive binary search (#2229)

Browse Source
This commit is contained in:
Prashant Anand 2020-08-01 14:26:04 +09:00 committed by GitHub
parent c6c9f4707b
commit b57b6abb48
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
searches/binary_search.py
View File

@ -261,16 +261,16 @@ def binary_search_by_recursion(sorted_collection, item, left, right):
:return: index of found item or None if item is not found :return: index of found item or None if item is not found
Examples: Examples:
>>> binary_search_std_lib([0, 5, 7, 10, 15], 0) >>> binary_search_by_recursion([0, 5, 7, 10, 15], 0, 0, 4)
0 0
>>> binary_search_std_lib([0, 5, 7, 10, 15], 15) >>> binary_search_by_recursion([0, 5, 7, 10, 15], 15, 0, 4)
4 4
>>> binary_search_std_lib([0, 5, 7, 10, 15], 5) >>> binary_search_by_recursion([0, 5, 7, 10, 15], 5, 0, 4)
1 1
>>> binary_search_std_lib([0, 5, 7, 10, 15], 6) >>> binary_search_by_recursion([0, 5, 7, 10, 15], 6, 0, 4)
""" """
if right < left: if right < left: