Lectures

Title

Markup

Applets
 Introduction, stacks and queues   Introduction, stacks and queues  Circular array queue
 Asymptotic analysis   Asymptotic analysis  
 Priority queues & binary heaps   Priority queues & binary heaps  Binary heap
 Max Heap ("Heap" tab)
 Java Generics and JUnit (from section)    
 Skew heaps   Skew heaps   Skew heap
 d-Heaps   d-Heaps  
 Binomial queues   Binomial queues  Binomial queue (heap)
 Binary search trees   Binary search trees  Binary search trees ("BST" tab)
 AVL trees   AVL trees  AVL trees ("AVL tree" tab)
 AVL deletions   AVL deletions  
 Splay trees   Splay trees  Splay trees ("Splay tree" tab)
 Note: their "insert" is different from lecture!
 B-trees and B+ trees   B-trees and B+ trees  3-4-5 B-trees ("B-tree" tab)
 Note: not a B+ tree.
 Other self-balancing trees   Other self-balancing trees  Red-black trees, treaps, AA trees,
 scapegoat trees, skiplists (look at tabs)
 Hash tables   Hash tables  Hash tables
 Sorting   Sorting  Sorting visualizations (choose algorithm, click on image)
 More sorting demos (launches separate applet window)
 Mergesort   Mergesort  
 Quicksort and Bound on Comparison Sorts   Quicksort and Bound on Comparison Sorts  
 Bucket and Radix Sorts   Bucket and Radix Sorts   Radix sort (hit re-load to get new array)
 Disjoint Set Union/Find   Disjoint Set Union/Find  
 Disjoint Set Union/Find (part 2)   Disjoint Set Union/Find (part 2)  
 Graphs   Graphs  
 Shortest Paths / Dijkstra's Algorithm   Shortest Paths / Dijkstra's Algorithm  
 Spanning trees   Spanning trees  
 NP-completeness   NP-completeness