Create slowsort.py

[DjaouadNM]

added slowsort algorithm implementation to sorts

Describe your change:

• 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 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 have a URL in its comments that points to Wikipedia or other similar explanation.
• If this pull request resolves one or more open issues then the commit message contains Fixes: #{$ISSUE_NO}.

[mrmaxguns]

I believe this algorithm has been already added here.

[DjaouadNM]

The algorithm you linked to is Bogosort, which is an entirely different algorithm, but it is also called Slowsort at times.

[mrmaxguns]

Oh, ok. Sorry for the misunderstanding

[DjaouadNM]

No worries, you could look at the code and notice the differences, you could also check Bogosort and Slowsort at Wikipedia.

[mrmaxguns]

Isort failed, looks like you need to reorder the imports

[DjaouadNM]

Done!

[mrmaxguns]

Thanks for contributing to open source 👍

@cclauss could you review and merge this pull request?

[dhruvmanila]

@algorithms-keeper review

[ghost]

Click here to look at the relevant links ⬇️

🔗 Relevant Links

Repository:

• Contributing guidelines
• Project Euler solution guidelines

Python:

• Type hints
• doctest
• unittest
• pytest

Automated review generated by algorithms-keeper. If there's any problem regarding this review, please open an issue about it.

---

algorithms-keeper commands and options

algorithms-keeper actions can be triggered by commenting on this PR:

• @algorithms-keeper review to trigger the checks for only added pull request files
• @algorithms-keeper review-all to trigger the checks for all the pull request files, including the modified files. As we cannot post review comments on lines not part of the diff, this command will only modify the labels accordingly.

NOTE: Commands are in beta and so this feature is restricted only to a member or owner of the organization.

[ghost]

Please provide descriptive name for the parameter: i

Please provide descriptive name for the parameter: j

[stale]

This pull request has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.

[mrmaxguns]

A maintainer should probably merge this PR unless there's an issue; we don't want valid pull requests to be closed as stale 😞

[cclauss]

@mrmaxguns If you believe that this PR is ready to be landed, please click the Review changes button at https://github.com/TheAlgorithms/Python/pull/3865/files and Approve.

[mrmaxguns]

This pull request is good to good to go:

• Unique
• Docstrings
• Type hints
• Readability
• Doctests

[amaank404]

this looks good to go, although i would like to ask if it is prone to recursion error

[cclauss]

@mateuszz0000 Is this ready to land?

[DjaouadNM]

this looks good to go, although i would like to ask if it is prone to recursion error

Nothing but a maximum recursion depth exceeded with large lists, but this is the case with all recursive functions (in Python), and this algorithm isn't really made for practical use, so it isn't a necessary thing to use sys.setrecursionlimit to try and overcome the error.

[cclauss]

I am not a fan of purposefully inefficient algorithms of little utility (esp. sleep_sort!) -- perhaps the humourous nature is beyond my comprehension. Heating the planet with inefficient algorithms is what TheAlgorithms are trying to avoid. But this one has been batted about long enough so let's land it...