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

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

Author: pre-commit-ci[bot]

data_structures/reversesort.py

@@ -1,6 +1,6 @@
 def reverse_selection_sort(arr: list[int]) -> list[int]:
     """
-    Sorts an array using a modified selection sort algorithm where after finding 
+    Sorts an array using a modified selection sort algorithm where after finding
     the minimum element, a subarray is reversed instead of swapping.
 
     Parameters:
@@ -12,16 +12,16 @@ def reverse_selection_sort(arr: list[int]) -> list[int]:
     Example:
     >>> reverse_selection_sort([64, 25, 12, 22, 11])
     [11, 12, 22, 25, 64]
-    
+
     >>> reverse_selection_sort([5, 4, 3, 2, 1])
     [1, 2, 3, 4, 5]
-    
+
     >>> reverse_selection_sort([3, 1, 2])
     [1, 2, 3]
-    
+
     >>> reverse_selection_sort([10])
     [10]
-    
+
     >>> reverse_selection_sort([])
     []
     """
@@ -39,10 +39,12 @@ def reverse_selection_sort(arr: list[int]) -> list[int]:
         # If the minimum is not already at position i, reverse the subarray
         if min_index != i:
             # Reverse the subarray from position i to min_index
-            arr[i:min_index + 1] = reversed(arr[i:min_index + 1])
+            arr[i : min_index + 1] = reversed(arr[i : min_index + 1])
 
     return arr
 
+
 if __name__ == "__main__":
     import doctest
+
     doctest.testmod()