Added Sorting Algorithm (Bogo Sort) #36
Merged
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
gaurang7goel
approved these changes
Oct 3, 2022
|
#4 issue |
AnirudhDaya
requested changes
Oct 3, 2022
requested changes are made |
AnirudhDaya
approved these changes
Oct 3, 2022
AnirudhDaya
added
enhancement
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Bogosort (also known as permutation sort, stupid sort, or slowsort) is a sorting algorithm
based on the generate and test paradigm. The function successively generates permutations
of its input until it finds one that is sorted. It is not considered useful for sorting,
but may be used for educational purposes, to contrast it with more efficient algorithms.