Yet another explanation of the Quicksort algorithm

This is not at all a good explanation of quicksort and in some cases like finding the arithmetic mean, it isn't even right.

Here is a simple explanation:

First, understand the partition algorithm. You have an unsorted array, pick a value, then put everything less or equal on one side and everything greater on the other side of the array. The partition function returns the crossover point in the array that separates the two sides once it is done.

Quicksort is just a recursive partition. You partition an array, then partition one side after that, until you just end up with two elements and you don't need to recursively sort any further.

Yeah there's a lot not great in this.

Mean instead of median is a big one. I'd object more to the basic lack of explanation in many parts though, including why you'd pick the mean (during which they could well have talked themselves into fixing that error), why randomized is a decent strategy, what you're trying to avoid in a pivot, etc.