I have a real static visualization. I should put some pictures online. My visualization does not rely on in-place algorithms: There's a square of pixels n x n, if two items are compared by the algorithm the corresponding pixel turns black, otherwise it stays white.<p>The traces of mergesort, quicksort and so on are quit distinctive.
I'd prefer to see these where each step in the algorithm was a fixed width that is the same across all of the images. As-is the step width is dependent on the number of steps. This fails to show the speed of convergence.
This is excellent. In my opinion, this is the way algorithm information should be presented. No abundant scientific formulations. Python works well as a pseudo-code substitute and visualizations are clear and intuitive.
Along the same lines, but real-time animated for different data characteristics:<p><a href="http://www.sorting-algorithms.com/" rel="nofollow">http://www.sorting-algorithms.com/</a>