CS252 Algorithms
Friday, 10 May 2024

+ Quick note on inductive proofs & recurrence relations
- Guess a formula + proof it by induction
- How I like to think about induction
- = vs. <=

+ The next two weeks
- Divide-and-conquer continued
- Dynamic programming continued
- Network flows

+ Questions on homework?

+ Some problems
- Knapsack problem (DP, section 6.4)
- Inversion counting (D&C, section 5.3)
- Minimum edit distance (DP, not in book)

+ Knapsack problem
- Input:
- Output:
- What's being optimized?
- Search space?
- Recurrence
- Filling in the chart