Show HN: Illustrated Quicksort algorithm
some constructive feedback: one of the greatest features of quicksort is that it is an in-place algorithm, it doesn't use any additional storage. qsort cleverest trick is to switch an element greater than the pivot with one smaller in a single step, and all of that is lost in the animation when the first thing it does is to group the fruits into the "less" and "greater" piles. as it is, your animation is great, but it doesn't really illustrate qsort, especially the most fundamental aspects that set it apart from other sorting algorithms.