Stooge sort is a highly inefficient sorting algorithm that is primarily of theoretical interest or as a demonstration of poor algorithm design. It was introduced in the context of computer science education to illustrate the concept of sorting algorithms in a humorous or whimsical manner. ### Algorithm Description Stooge sort works based on a recursive approach. The algorithm sorts an array (or list) by following these steps: 1. If the first element is greater than the last element, swap them.
Articles by others on the same topic
First exchange the endpoints of the current subarray if they are out of order. For current length , put and recursively sort its first entries, its last entries, then its first entries again. Each child has length ; the split must use the current subproblem length. The master theorem gives exponent , worse than quadratic. The usual algorithm is not stable: endpoint exchange on leaves the equal-key records reversed after sorting.