Lecture
This lecture covers the substitution method for solving recurrences, including the proof of guess, lower bound, and upper bound. It also discusses common mistakes using the substitution method and introduces the Master Theorem for black-box solving recurrences. The lecture concludes with recursion trees and the analysis of our favorite example, showcasing the efficiency of divide-and-conquer algorithms.