Slow Sort

Slow Sort is a deliberately inefficient, recursive sorting algorithm that works by recursively sorting all but the last element, then sorting all but the first element, and finally swapping the first and last elements if needed. It's mostly for academic or illustrative purposes.