logical change in binary search's bisect left and right's "hi" limit

Author: Nisarg-patel-2410

searches/binary_search.py

@@ -45,7 +45,7 @@ def bisect_left(
     2
     """
     if hi < 0:
-        hi = len(sorted_collection)
+        hi = len(sorted_collection)-hi
 
     while lo < hi:
         mid = lo + (hi - lo) // 2
@@ -86,7 +86,7 @@ def bisect_right(
     2
     """
     if hi < 0:
-        hi = len(sorted_collection)
+        hi = len(sorted_collection)-hi
 
     while lo < hi:
         mid = lo + (hi - lo) // 2