Handouts

List of handouts:

• 1/13 HO-01 comparing algorithms
• 1/15 HO-02 induction (horses)
• 1/20 HO-03 asymptotics
• 1/27 HO-04 recurrence relations
• 2/3 HO-05 recursion invariants
• 2/5 HO-06 master theorem
• 2/16 HO-07 Decrementing Functions
• 3/3 HO-08 Dynamic Programming
• 3/5 HO-09 Analyzing Algorithms (including Loop Invariants)
• 3/12 HO-10 Topological Sort