Sorting Algorithms Questions
The worst-case time complexity of stooge sort is O(n^(log3/log1.5)) or approximately O(n^2.7095).