[pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

Author: pre-commit-ci[bot]

searches/binary_search.py

@@ -199,8 +199,7 @@ def binary_search(sorted_collection: list[int], item: int) -> int:
     """
     if any(a > b for a, b in pairwise(sorted_collection)):
         raise ValueError(
-            "Input list must be sorted in ascending order "
-            "for binary search to work"
+            "Input list must be sorted in ascending order for binary search to work"
         )
     left = 0
     right = len(sorted_collection) - 1
@@ -239,8 +238,7 @@ def binary_search_std_lib(sorted_collection: list[int], item: int) -> int:
     """
     if list(sorted_collection) != sorted(sorted_collection):
         raise ValueError(
-            "Input list must be sorted in ascending order "
-            "for binary search to work"
+            "Input list must be sorted in ascending order for binary search to work"
         )
     index = bisect.bisect_left(sorted_collection, item)
     if index != len(sorted_collection) and sorted_collection[index] == item:
@@ -276,8 +274,7 @@ def binary_search_with_duplicates(sorted_collection: list[int], item: int) -> li
     """
     if list(sorted_collection) != sorted(sorted_collection):
         raise ValueError(
-            "Input list must be sorted in ascending order "
-            "for binary search to work"
+            "Input list must be sorted in ascending order for binary search to work"
         )
 
     def lower_bound(sorted_collection: list[int], item: int) -> int:
@@ -394,8 +391,7 @@ def exponential_search(sorted_collection: list[int], item: int) -> int:
     """
     if list(sorted_collection) != sorted(sorted_collection):
         raise ValueError(
-            "Input list must be sorted in ascending order "
-            "for binary search to work"
+            "Input list must be sorted in ascending order for binary search to work"
         )
 
     bound = 1