diff --git a/sorts/reverse_selection_sort.py b/sorts/reverse_selection_sort.py
index aeb5cf7cf..b87ab0bc5 100644
--- a/sorts/reverse_selection_sort.py
+++ b/sorts/reverse_selection_sort.py
@@ -16,6 +16,7 @@ Examples:
 [98, 34, -1, -2, -42]
 """
 
+
 def reverse_selection_sort(collection: list) -> list:
     """
     A pure implementation of reverse selection sort algorithm in Python.
@@ -32,7 +33,7 @@ def reverse_selection_sort(collection: list) -> list:
                 max_idx = j
 
         # Reverse the subarray from the current position to the end
-        collection[i:max_idx+1] = reversed(collection[i:max_idx+1])
+        collection[i : max_idx + 1] = reversed(collection[i : max_idx + 1])
 
     return collection