Algorithms In Action

Authors: Linda Stern; Lee Naish; Harald Sondergaard

University of Melbourne


Project URL:


Warning: Due to some cookie monitoring at their site, if you save the link and go directly to the AIA "demo page", you might receive an error message (it will complain that you need cookies, javascript, and java enabled). So safer to go to the link above, and from there click on the "enter" button go to the "demo index" that accesses the individual modules.

These AVs are generally of high quality, with most getting "Recommended" scoring.


AVs are available on the following topics:

Searching: Binary Seach tree, 2-3-4 Tree, Red-Black tree, Digital Search Tree, Radix Trie and Multiway Radix Trie, Patricia Tree (recursive and iterative), Splay Tree (recursive and iterative), Skip List

Sorting: Shellsort, Quicksort, Heapsort, Distribution Counting, Straight Radix Sort, Radix Exchange Sort

String Algorithms: Boyer Moore, KMP

Graph Algorithms: Breadth-First Search, Depth-First Search, Minimum Spanning Tree (Prim’s and Kruskal’s Algorithms)

This project was originally developed around 1999-2002. During 2009 a new collection of AVs was introduced, and there was also an extensive effort ongoing to internationalize AIA, with the initial version being done in Italian.

Catalog Entries: