Algorithms In Action

Authors: Linda Stern; Lee Naish; Harald Sondergaard University of Melbourne 2000

http://www.cs.mu.oz.au/aia/

Paper:

The publicly available "demo" version includes AVs (as Java Applets) for:

The full version is available on request from Linda Stern (stern AT unimelb.edu.au). It includes AVs for the following topics:

Searching: Sorted list, Binary search 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: Selection Sort, Insertion Sort, Shellsort, Quicksort, Heapsort, Distribution Counting, Straight Radix Sort, Radix Exchange Sort

Graph Algorithms: Breadth-First Search, Depth-First Search, Minimum Spanning Tree (Prim's and Kruskal's Algorithms), Transitive Closure (Floyd's Algorithm)

String Algorithms: Boyer Moore, KMP

Dynamic Programming Alignment Algorithms: Global, Local

This project was originally conducted around 1999-2002, and as of early 2010, what you see publicly is still that original collection. However, during 2009 there was an extensive effort underway to test a new collection of AVs, and there was also an extensive effort ongoing to internationalize AIA, with the initial version being done in Italian. Contact the author for a current list. Hopefully the new AVs will be made publicly accessible soon.