CS3114 Data Structures and Algorithms
Algorithm Visualization List

Here is a list of AVs that either I used last semester with the course, or that I have found useful in the past for particular course topics.

• JHAVEPOP: Practice for manipulating points and linked lists (AlgoViz Catalog Description)
• Memory management tutorial (AlgoViz Catalog Description)
• (Bucket) PR Quadtree Demo (AlgoViz Catalog Description)
• Binary Treesome: BST insert (AlgoViz Catalog Description)
• Trakla BST: BST delete exercise (AlgoViz Catalog Description)
• Trakla2 Heap Tutorial (AlgoViz Catalog Description)
• Huffman Coding Tree (AlgoViz Catalog Description)
• Union/Find AV (AlgoViz Catalog Description)
• Sorting Overview visualization (lets you see a visual comparison of multiple algorithms running at once) (AlgoViz Catalog Description)
• Comparison Sorts (good for insertion sort, selection sort, bubble sort).
• Quicksort visualization (Click on the "Enter" button and then find the Quicksort listed on the left menu) (AlgoViz Catalog Description)
• Radix sort visualization (AlgoViz Catalog Description)
• Buffer pool visualization (AlgoViz Catalog Description)
• Hashing tutorial (AlgoViz Catalog Description)
• B-Tree and B⁺-tree visualization. Note that 2-3 Trees are simply B-trees of degree 3.
• Queue-based Topological Sort Visualization: You will need webstart to run this (AlgoViz Catalog Description)
• Graph Algorithms: JHAVE Visualizations: You will need webstart to run this.
  • Depth-first First Search
  • Breadth First Search
  • Topological Sort (Queue-based)
  • Dijkstra's Algorithm
  • Prim's MCST Algorithm
  • Kruskal's MCST Algorithm

Go to the CS3114 Homepage.