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

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

Author: pre-commit-ci[bot]

sorts/reverse_selection.py

@@ -10,10 +10,11 @@
 python3 reverse_selection_sort.py
 """
 
+
 def reverse_subarray(arr: list, start: int, end: int) -> None:
     """
     Reverse a subarray in-place.
-    
+
     :param arr: the array containing the subarray to be reversed
     :param start: the starting index of the subarray
     :param end: the ending index of the subarray
@@ -39,6 +40,7 @@ def reverse_subarray(arr: list, start: int, end: int) -> None:
         start += 1
         end -= 1
 
+
 def reverse_selection_sort(collection: list) -> list:
     """
     A pure implementation of reverse selection sort algorithm in Python
@@ -70,14 +72,15 @@ def reverse_selection_sort(collection: list) -> list:
         for j in range(i + 1, n):
             if collection[j] < collection[min_idx]:
                 min_idx = j
-        
+
         # If the minimum is not at the start of the unsorted portion,
         # reverse the subarray to bring it to the front
         if min_idx != i:
             reverse_subarray(collection, i, min_idx)
-    
+
     return collection
 
+
 if __name__ == "__main__":
     user_input = input("Enter numbers separated by a comma:\n").strip()
     unsorted = [int(item) for item in user_input.split(",")]