CS252 Algorithms
Friday, 21 October 2022

+ Today
- Solving/proving recurrences
- Take a spin through the problem set
- Play with inversion counting

+ Recurrences
- Come up with the recurrence
    (sloppy on the base case)
- Guess a claim "T(n) <= k g(n) forall n >= 1"
- Prove the claim by induction
    (getting there may involve tinkering with
     the constants in the recurrence)