learning$algorithms

Stooge Sort

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

Explanation: The recursive sorting algorithm that swaps elements at the start and end of a list, then recursively sorts overlapping sections. Known for extreme inefficiency with O(n^(log 3 / log 1.5)) complexity.

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