Add Sleep Sort algorithm to advanced Python sorting algorithms (#13203)#13415
Add Sleep Sort algorithm to advanced Python sorting algorithms (#13203)#13415Aviraj2929 wants to merge 2 commits intoTheAlgorithms:masterfrom
Conversation
There was a problem hiding this comment.
Click here to look at the relevant links ⬇️
🔗 Relevant Links
Repository:
Python:
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 reviewto trigger the checks for only added pull request files@algorithms-keeper review-allto 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 post all the messages in one comment.NOTE: Commands are in beta and so this feature is restricted only to a member or owner of the organization.
| import threading | ||
| import time | ||
|
|
||
| def sleep_sort(arr): |
There was a problem hiding this comment.
As there is no test file in this pull request nor any test function or class in the file sorts/sleep_sort.py, please provide doctest for the function sleep_sort
Please provide return type hint for the function: sleep_sort. If the function does not return a value, please provide the type hint as: def function() -> None:
Please provide type hint for the parameter: arr
| """ | ||
| result = [] | ||
|
|
||
| def sleeper(x): |
There was a problem hiding this comment.
As there is no test file in this pull request nor any test function or class in the file sorts/sleep_sort.py, please provide doctest for the function sleeper
Please provide return type hint for the function: sleeper. If the function does not return a value, please provide the type hint as: def function() -> None:
Please provide descriptive name for the parameter: x
Please provide type hint for the parameter: x
for more information, see https://pre-commit.ci
|
Closing require_descriptive_names PRs to prepare for Hacktoberfest |
Describe your change:
Sleep Sort is a novelty sorting algorithm that sorts numbers using timing and concurrency. Each number “sleeps” for a duration proportional to its value and then outputs itself. Smaller numbers appear first because they wake up earlier.
Checklist: