A really ahh algorithm I invented that is related to @frankblob's Shove Sort Worst case: n^3 (probably) Average case: n^3 Best case: n It is the most ahh ahh sort
This sort is the halfway point between Shove Sort and Tiny Gnome Sort, which is why it looks similar to Insertion Sort at the end.
