diff --git a/sorts/reverse_selection_sort.py b/sorts/reverse_selection_sort.py
new file mode 100644
index 000000000000..b87ab0bc5dc5
--- /dev/null
+++ b/sorts/reverse_selection_sort.py
@@ -0,0 +1,44 @@
+"""
+A Python implementation of the Reverse Selection Sort algorithm.
+
+This algorithm progressively sorts the array by finding the largest
+element and reversing subarrays to place it at the correct position.
+
+Inspired by the Pancake Sorting algorithm.
+For more information, see: https://en.wikipedia.org/wiki/Pancake_sorting
+
+Examples:
+>>> reverse_selection_sort([45, 23, 11, 89, 54, 1, 3, 36])
+[89, 54, 45, 36, 23, 11, 3, 1]
+>>> reverse_selection_sort([0, -89, 32, 5, 46, 8, 11])
+[46, 32, 11, 8, 5, 0, -89]
+>>> reverse_selection_sort([34, -2, -1, 98, -42])
+[98, 34, -1, -2, -42]
+"""
+
+
+def reverse_selection_sort(collection: list) -> list:
+    """
+    A pure implementation of reverse selection sort algorithm in Python.
+    :param collection: some mutable ordered collection with heterogeneous
+    comparable items inside
+    :return: the same collection sorted in descending order
+    """
+    n = len(collection)
+    for i in range(n):
+        # Find the maximum element in the unsorted portion
+        max_idx = i
+        for j in range(i + 1, n):
+            if collection[j] > collection[max_idx]:
+                max_idx = j
+
+        # Reverse the subarray from the current position to the end
+        collection[i : max_idx + 1] = reversed(collection[i : max_idx + 1])
+
+    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(",")]
+    print(reverse_selection_sort(unsorted))