Stooge sort
Stooge sort is a recursive sorting algorithm. It is notable for its exceptionally poor time complexity of O ( n log 3 / log 1.5 ) {\displaystyle O(n^{\log 3/\log 1.5})} = O ( n 2.7095...
Stooge sort is a recursive sorting algorithm. It is notable for its exceptionally poor time complexity of O ( n log 3 / log 1.5 ) {\displaystyle O(n^{\log 3/\log 1.5})} = O ( n 2.7095...
Stooge sort is a recursive sorting algorithm. It is notable for its exceptionally poor time complexity of O ( n log 3 / log 1.5 ) {\displaystyle O(n^{\log 3/\log 1.5})} = O ( n 2.7095...
Source: Wikipedia "Stooge sort" · CC BY-SA 4.0
Share this article: X · Bluesky