We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 4d65558 commit 10d86d2Copy full SHA for 10d86d2
searches/binary_search.py
@@ -45,7 +45,7 @@ def bisect_left(
45
2
46
"""
47
if hi < 0:
48
- hi = len(sorted_collection)+hi+1 #in case of negetive indexing used for hi
+ hi = len(sorted_collection) + hi + 1 # in case of negetive indexing used for hi
49
50
while lo < hi:
51
mid = lo + (hi - lo) // 2
@@ -86,7 +86,7 @@ def bisect_right(
86
87
88
89
90
91
92
0 commit comments