Inspired by @aphitorite 's flan sort this does an inplace merge sort. ofc this lowk just a demo but it is cool to see how it works. Worst: n log n (after I fix the partition) Average: n log n Best: n (I need to make it pattern defeating first)
