Visualising Sorting Algorithms

This page contains the most up-to-date versions of the static sorting algorithm visualisations that I first described in a blog post in 2007. Since then a few things have changed, and I have a few more improvements up my sleeve. There's more information on the construction of these graphs in the original post. The code to generate these graphs can be found on github.

To show an interesting subset of the behaviour of timsort, this graph is somewhat larger than the others on this page, and the element ordering is not random. A detailed description of the graph can be found here.