Handouts

Handouts/Lecture Notes



 

DateTopic
Aug 23Insertion Sort
Aug 25Merge Sort
Aug 30Asymptotic Notation Table 1, Table 2
Sept 15Trees
Sept 15Heap Sort
Sept 20Quick Sort
Sept 22Analysis of Quick Sort
Sept 24Order Statistics & Sorting Lower Bound
Sept 27Sorting in Linear Time
Sept 29Binary Search Trees
Oct 1Red-Black Trees
Oct 4Red-Black Tree Insertion
Oct 6Dynamic Programming
Oct 11Longest Common Subsequence
Oct 15Greedy Algorithms
Oct 20Knapsack Problems
Oct 27Graph Basics
Nov 1Breadth-First Search
Nov 3Depth-First Search
Nov 8Minimum Spanning Trees (Part 1)
Nov 10Minimum Spanning Trees (Part 2)
Nov 12Single-Source Shortest Paths (Part 1)
Nov 15Single-Source Shortest Paths (Part 2)
Nov 17All-Pairs Shortest Paths
Nov 19NP-Completeness (Part 1)
Nov 29NP-Completeness (Part 2)
Dec 1NP-Completeness (Part 3)
Dec 6String Matching
Dec 8The Knuth-Morris-Pratt Algorithm

 


 

Iowa State University - Computer Science Department - Top of this page