mirror of
https://github.com/TheAlgorithms/Python.git
synced 2025-07-05 17:34:49 +08:00
@ -51,7 +51,7 @@ def bisect_left(
|
|||||||
hi = len(sorted_collection)
|
hi = len(sorted_collection)
|
||||||
|
|
||||||
while lo < hi:
|
while lo < hi:
|
||||||
mid = (lo + hi) // 2
|
mid = lo + (hi - lo) // 2
|
||||||
if sorted_collection[mid] < item:
|
if sorted_collection[mid] < item:
|
||||||
lo = mid + 1
|
lo = mid + 1
|
||||||
else:
|
else:
|
||||||
@ -96,7 +96,7 @@ def bisect_right(
|
|||||||
hi = len(sorted_collection)
|
hi = len(sorted_collection)
|
||||||
|
|
||||||
while lo < hi:
|
while lo < hi:
|
||||||
mid = (lo + hi) // 2
|
mid = lo + (hi - lo) // 2
|
||||||
if sorted_collection[mid] <= item:
|
if sorted_collection[mid] <= item:
|
||||||
lo = mid + 1
|
lo = mid + 1
|
||||||
else:
|
else:
|
||||||
|
Reference in New Issue
Block a user