Stooge sort is a recursive sorting algorithm with a time complexity of O(n) = O(n). 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.