learning$algorithms

Bogo Sort

PrevNext
Term side of the Card
Topic: Inefficient Sorting Algorithms
Unit title: Bogo Sort
Categories: Algorithm, Concept
Explanation side of the Card

Explanation: The inefficient sorting algorithm that randomly rearranges elements until they are sorted. Extremely slow with average time complexity of O((n+1)!).

Edit on GitHubContributions in our content repository are 🤗 welcome from everyone.Link leads to the Contributions guidelines on GitHubLink leads to the content repository on GitHub