tag

#recursive

2 pages tagged

Wiki › Algorithms › 01. Searching and Sorting › 6. Elementary Sorting ›

Stooge Sort

Stooge Sort Stooge sort is a recursive sorting algorithm with very poor efficiency. It repeatedly sorts overlapping parts of the array. The algorithm has theoretical interest but no practical use. Problem Given a sequence $A$ of length $n$, reorder it such that $$ A[0] \le A[1] \le \cdots \le A[n-1] $$ Algorithm For a subarray $A[l..r]$: If the first element is greater than the last, swap them If the size...

Wiki › Algorithms › 01. Searching and Sorting › 6. Elementary Sorting ›

Slow Sort

Slow Sort Slow sort is a deliberately inefficient recursive sorting algorithm. It is based on the multiply and surrender paradigm, a parody of divide and conquer. The algorithm recursively sorts both halves, compares their maximum elements, places the larger one at the end, and then recursively sorts the remaining prefix. It is mostly useful as a teaching example for bad recursion design. Problem Given a sequence $A$ of length $n$,...