The stooge sort algorithm swaps the top and bottom items, then sorts the bottom two-thirds, top two-thirds, and bottom two-thirds again (recursively). We can summarize stoop sort in the following methods:
1. Swap the values if the value at index 0 is larger than the value at the final index
2. Stooge sorts the first 2/3rd of the array recursively.
3. Sort the final 2/3 of the array with Stooge.
4. To double-check, Stooge sorts the first two-thirds again.