A very slow but simple algorithm devised by @frankblob Worst case: n^3 Average case: n^3 Best case: n with some modifications it could be adaptive but for now it's just cooked
Made Shove Sort as fast as it possibly can be Unlike the original Shove Sort which has an advantage of being online, Optimised Shove Sort is unfortunately not online, as only shove sorts that return the pointer to zero could be online; Gnome Sort is an exception.
