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

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

searches/binary_search.py

@@ -179,10 +179,11 @@
 
 
 # Binary Search Algorithm
 # Binary Search is an efficient algorithm for finding an item from a sorted list of items.
 # It works by repeatedly dividing in half the portion of the list that could contain the item,
 # until you've narrowed the possible locations to just one.
 
+
 def binary_search(arr, x):
     """
     Perform a binary search to find the element `x` in the sorted list `arr`.
@@ -192,7 +193,7 @@
     x (int or float): The element to search for in the list
 
     Returns:
     int: The index of the element `x` in the list `arr`. If `x` is not found, returns -1.
     """
     low = 0
     high = len(arr) - 1
@@ -213,6 +214,7 @@
     # Return -1 if element is not present in the list
     return -1
 
+
 def binary_search_std_lib(sorted_collection: list[int], item: int) -> int:
     """Pure implementation of a binary search algorithm in Python using stdlib