Dec 30, 2025 · The Substitution Method is a technique used to find the time complexity of recursive algorithms by expanding the recurrence relation, identifying a pattern, and then proving the result …

The substitution method for solving recurrences is famously described using two steps: Guess the form of the solution. Use induction to show that the guess is valid. This method is especially powerful …

Warning: Using the substitution method, it is easy to prove a weaker bound than the one you're supposed to prove. For instance, if the runtime is O(n), you might still be able to substitute cn2 into …

Show that a substitution proof with the assumption T (n) ≤ c n 2 T (n)≤ cn2 fails. Then show how to subtract off a lower-order term to make the substitution proof work.

We will use different methods than what was done for solving recurrences in CSE 2315, but one may still benefit from reviewing that material. It may not be clear what the complexity is, by just looking at …

This playlist is entirely dedicated to solved problems on recurrence relations, showing step-by-step how to derive asymptotic bounds and strengthen your problem-solving skills. The Substitution...

Rationale: In the substitution method, we aim to prescribe a set of su↗ cient conditions for c1 and c2, and then “solve” c1 and c2 from those conditions. We will resort to mathematical induction to achieve …

The inductive hypothesis is applied to smaller values, similar like recursive calls bring us closer to the base case. The substitution method is powerful to establish lower or upper bounds on a recurrence. …

Jun 3, 2011 · While solving some recurrences it is good to recognize some nice things about the recurrence you are actually solving. For instance in this recurrence, notice that at each step you are …

Apr 11, 2025 · The substitution method is a technique to solve recurrence relations, commonly arising in divide-and-conquer algorithms (e.g., Merge Sort, Strassen’s Matrix Multiplication).