-
Notifications
You must be signed in to change notification settings - Fork 18.7k
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
[FEATURE REQUEST] Sleep Sort Algorithm #5137
Labels
Comments
assign me |
hey, @pankaj-bind if you are not working on it, can it be assigned to me? |
it is not yet assigned |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
What would you like to Propose?
Sleep sort is a unique sorting algorithm that utilizes sleep functions to achieve sorting. The basic idea behind the algorithm is to assign each element in the list to a separate thread. Each thread then sleeps for an amount of time proportional to the value of the element it is assigned. Once all threads have finished sleeping, the elements are sorted in ascending order based on the time they took to sleep.
Issue details
Algorithm Description: Provide a clear and concise explanation of the Sleep Sort algorithm.
Implementation: Implement the Sleep Sort algorithm in the programming language of your choice.
Testing: Develop test cases to ensure the correctness of the implementation.
Documentation: Document the code and algorithm to facilitate understanding for future developers.
Additional Information
Sleep sort is not suitable for practical use due to its inefficiency and unpredictability. It's mainly used for educational and entertainment purposes.
The text was updated successfully, but these errors were encountered: