COT5407  Introduction to Algorithms Lectures
 Aug 23 and 25: Introduction to Algorithms, BigOh, etc.
 Read Chapters 14 in CLRS
 Aug 30 and Sept 1: Sorting and Order Statistics
 Read Chapter 7, Section 8.1, and Chapter 9 in CLRS
 Sept 6: Adversary Lower Bound Arguments
 Sept 8, 13, 15: Hashing
 Sept 20: Radix Sort
 Sept 22 and 27: Binary Search Trees
 Homework #2 solutions
 AvlTree.java: AVL Tree Code, with insert, remove, contains
 Sept 29: Binary Heaps and Leftist Heaps
 October 4: Disjoint Sets
 Oct 6: Midterm Review
 OCTOBER 11: MIDTERM EXAM

Covers material through binary heaps (homeworks 1, 2, 3).
 Oct 13, 18, 20, 25, 27: Graph Algorithms
 Nov 1: Network Flow
 Nov 3 and 8: Amortized Analysis, Skew Heaps, Fibonacci Heaps
 Nov 10, 15, 17 : NP Completeness
 Nov 22: Dynamic Progamming
 Nov 24: No class
 Nov 29: String Algorithms
 KnuthMorris Pratt
 RabinKarp
 MoyerMoore
 Suffix Arrays and Trees
 Dec 1: Review of HW 5
 Dec 8: FINAL EXAM, 9:45 AM  11:45 AM, GL139.