#slow-sort

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$,...