Stooge sort is a recursivesorting algorithm with a time complexity of O(nlog 3 / log 1.5 ) = O(n2.7095...). The running time of the algorithm is thus slower compared to efficient sorting algorithms, such as Merge sort, and is even slower than Bubble sort, a canonical example of a fairly inefficient and simple sort.

The algorithm is defined as follows:

If the value at the end is smaller than the value at the start, swap them.

If there are more than 1 elements between start and end of the list, then: