Inspired by @aphitorite 's flan sort this does an inplace merge sort. It is a type of buffered merge sort, I will try to add buffers to Aeos Quicksort and use stable dual pivot quickselect in order to make Steakwadsort Worst: n log n (after I fix the partition) Average: n log n Best: n (I need to make it pattern defeating first)
https://scratch.mit.edu/projects/507136521/ is another method of Romysort but is less efficient.
