Add slowsort algorithm

[dipeshrayg]

Describe your change:

Adds Slowsort in sorts/slowsort.py.

Slowsort is a deliberately inefficient recursive sorting algorithm based on the
"multiply and surrender" paradigm, invented by Broder and Stolfi (1986). It
finds the maximum of two halves, places it at the end, then recurses — the
opposite of divide and conquer. Runs in superpolynomial time, making it a
classic example in pessimal algorithm analysis.

Reference: https://en.wikipedia.org/wiki/Slowsort

• Add an algorithm?
• Fix a bug or typo in an existing algorithm?
• 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 pull requests 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".

[diusazzad]

I have one minor suggestion regarding the user input block at the bottom (72-76):
If a user enters an empty string or non-integer values, [int(x) for x in user_input.split(",")] will raise a ValueError.You can make this more robust like -Wrap the input section in a try-except block to handle invalid inputs gracefully.Great job overall! Let me know what you think.