CS361 Algorithm Animations and Demonstrations

The animations were prepared using the AlgAE algorithm animation framework.
 

Full Animations

The animations listed below are complete running programs. You can choose any legal input values and observe the effects of that input on the data structures, while stepping though the actual code.

• Array operations: sequential insert, sequential search, binary search
• Generating random permutations of integers
• Implementing the std vector class
• Implementing the std list class
• Implementing the std deque class
• Sorting algorithms: insertion, Shell, merge, & quick sorts
• Converting recursion to iteration: quick sort revisited
• RPN calculator
• Binary search trees & binary tree traversals
• AVL balanced binary search trees
• Hash tables with separate chaining
• Hash tables with linear probing
• Heaps and Heap Sort
• Graphs
  • Directed graphs - depth-first and breadth-first traversals, topological sorts
  • Directed graphs - Dijkstra's algorithm for finding shortest paths
  • Undirected graphs - backtracking and graph coloring

Selected Shorts

The series of graphics commands emitted by an AlgAE animation can be captured for later playback, or can be created "from scratch" with an ordinary text editor. Here are a few sequences that I have used for illustrations in circumstances where I did not feel that a full running program was called for.

• Traversing a linked list.
• Inserting a node into a linked list.
• Deleting a node from a linked list.
• Stack operations.
• Implementing a Stack via arrays.
• Implementing a Stack via linked lists.
• Queue operations.
• Implementing a Queue via linked lists.
• Implementing a Queue via arrays.
• Implementing a Queue via arrays with modulus wrap-around.