During A-Levels we learnt about various sorting algorithms. To aid the teachers explanation of how they are performed and the difference in speed, I developed this simple demo.
It is written in Visual Basic 6, and provides both visualisation and time comparison of four sorting algorithms - Bubble, Selection, Shaker and Radix (yeah! no quicksort!). The visual option assigns random values to each vertical bar (represented as the height). Once the values are generated, the chosen algorithm will run. The time comparison runs behind the scenes, sorting 10,000 numeric values.
Because the Radix algorithm requires considerably less effort, I have also given the option to sort 1,000,000 numeric values.