Worst: n^2 (for non uniform lists) Average: nlogn Best: nlogn
This is not @TheLogFather's algorithm most likely as many people have probably thought of mean quicksort before him. I got this from @TheLogFather and it is one of the most popular niche sorting algorithms on Scratch (meaning it is a part of the sorting community, just not the mainstream one, rather a much more niche subset of Scratchers who sort), it is only good on uniform lists, similar to Flashsort. This is essentially very similar to medians of medians in concept but in practise is much like a distributive sorting algorithm
