Using the substitution and master methods
The substitution method is a condensed way of proving an asymptotic bound on a recurrence by induction. In the substitution method, instead of trying to find an exact closed-form solution, we only try to find a closed-form bound on the recurrence. This is often much easier than finding a full closed-form solution, as there is much greater leeway in dealing with constants.
Using the substitution and master methods Using the substituion and master methods Using the substituion method The substitution method is a condensed way of proving an asymptotic bound on a recurrence by induction. In the substitution method, instead of trying to find an exact closed-form solution, we only try to find a closed-form bound on the recurrence. This is often much easier than finding a full closed-form solution, as there is much greater leeway in dealing with constants. The substitution method is a powerful approach that is able to prove upper bounds for almost all recurrences. How
Explore this link on the map →related reading
- What's new | Updates on my research and expository papers, discussion of open problems, and other maths-related topics. By Terence Taoterrytao.wordpress.com
- An Intuitive Explanation of Solomonoff Induction — LessWronglesswrong.com
- Structure and Interpretation of Computer Programsmitp-content-server.mit.edu
- 245A: Problem solving strategies | What's newterrytao.wordpress.com
- Competitive Programmer's Handbookcses.fi
- Chernoff bound - Wikipediaen.wikipedia.org
- How Not to Teach Recursionparentheticallyspeaking.org
- Structure and Interpretation of Computer Programs, 2e: 1.2sarabander.github.io
- Gregory Gundersengregorygundersen.com
- Introduction to Dynamic Programming - Algorithms for Competitive Programmingcp-algorithms.com
- 1404.5236 Sum-of-Squares Proofs and the Quest toward Optimal Algorithmsarxiv.org
- Tabulation vs. Memoization | Baeldung on Computer Sciencebaeldung.com