Repos-que-me-gustan/devops-exercises
1
0
Fork 0
Code Pull Requests Activity

To avoid overflow, so change the mid value (#237)

Browse Source
This commit is contained in:
MX 2022-05-08 12:21:36 -04:00 committed by GitHub
parent 7c16c2b94e
commit 1ae937068c
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
coding/python/binary_search.py
View File

@ -9,7 +9,7 @@ def binary_search(arr: List[int], lb: int, ub: int, target: int) -> int:
A Binary Search Example which has O(log n) time complexity. A Binary Search Example which has O(log n) time complexity.
""" """
if lb <= ub: if lb <= ub:
mid: int = ub + lb // 2 mid: int = lb + (ub -lb)// 2
if arr[mid] == target: if arr[mid] == target:
return mid return mid
elif arr[mid] < target: elif arr[mid] < target: