Say you’re given a sequence of 20 random numbers and are tasked with sorting them from lowest to highest. How do you do that? There are quite a number of strategies. You could divide them into groups and refine as you go. Or you could always compare two adjacent numbers and put the lower of the two to the left. And so on. Computers have to do sorting operations all the time. Data visualisation designer Carlo Zapponi has found a fascinating way to illustrate how different sorting algorithms work (and how they compare in efficiency). Sounds a bit dull? Have a look for yourself and discover that it really isn’t.

From Weekly Filet #154, in March 2014.