Some of these examples look pretty, but as aids to help you understand
how the algorithm works, many of them are severely lacking.
To rectify this, two of our fourth year students are working on some
animations (with all the bells-and-whistles!), which include
tracking the code, values of critical variables and displaying statistics
as the problem is solved.
Their Java applets are under constant revision and they would appreciate
constructive comments and criticisms of their efforts.
- Thomas Niemann's text on sorting and searching
UWA animations
Please note that these are under active development!
- Chris Gan (1997)'s QuickSort Animation.
- Chien Wei Tan's QuickSort Animation.
- Mervyn Ng's Animation of
Dijkstra's Algorithm.
Continue on to algorithm animations
Back to the Table of Contents