Create reversesort

[Shwetasingh77]

Time Complexity: The time complexity of this algorithm is still O(n²), similar to traditional selection sort, since it involves finding the minimum element in the unsorted portion and reversing a subarray. Unique Feature: The reversal of subarrays distinguishes this algorithm from traditional selection sort, providing an interesting approach to sorting.

Describe your change:

Explanation: Find the Minimum: For each position i in the array, find the minimum element in the unsorted portion. Reverse Subarray: After finding the minimum element, reverse the subarray starting from i up to the position of the minimum element (min_index). Repeat: This process repeats for each subsequent position, progressively sorting the array.

• [ ] Add an algorithm?
• [ ] Fix a bug or typo in an existing algorithm?
• [ ] Add or change doctests? -- Note: Please avoid changing both code and tests in a single pull request.
• [ ] Documentation change?

Checklist:

• [ ] I have read CONTRIBUTING.md.
• [ ] This pull request is all my own work -- I have not plagiarized.
• [ ] I know that pull requests will not be merged if they fail the automated tests.
• [ ] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
• [ ] All new Python files are placed inside an existing directory.
• [ ] All filenames are in all lowercase characters with no spaces or dashes.
• [ ] All functions and variable names follow Python naming conventions.
• [ ] All function parameters and return values are annotated with Python type hints.
• [ ] All functions have doctests that pass the automated testing.
• [ ] All new algorithms include at least one URL that points to Wikipedia or another similar explanation.
• [ ] If this pull request resolves one or more open issues then the description above includes the issue number(s) with a closing keyword: "Fixes #ISSUE-NUMBER".