Worst: n^2 Average: n^2 Best: n^2 Inplace: yes Stable: no Regular Smelly Sort: An n^2 integer sort n^3 regular values (which users cycle check rather than value correspondence to indexes)
Smelly Sort https://scratch.mit.edu/projects/1237880471 by @t4444_444 Smelly Sort uses a lot of unnecessary write operations, though the idea of using reversals is preserved. It can be considered optimised Pancake sort, but the idea of using reversals beyond the minimum of the list and the minimum pointer is unnecessary. To remain faithful to the original algorithm, the list is partially sorted first, although the inefficient sort using insertions is swapped out with cyclesort.
