I'm using this other cool visualization [1] for my sorting repo [2] (thanks invzhi!)

1: https://github.com/invzhi/sorting-visualization/

2: https://github.com/ncruces/sort

Those choices (what counts as a step) are interesting because e.g. for my quicksort they make it look median-of-3 is about as fast as median-of-ninthers (it's not it's significantly faster), which would make my strategy of starting with median-of-3 and doing a round of ninthers for pathological input a bit absurd.

The visualization was still incredibly useful (I found) in getting a sense that the algorithm is working correctly. You can clearly see how median-of-ninthers is working in that gif.