Recurrences & The Master Theorem

Writing recurrences, recursion trees, the master theorem cases, and the substitution method.

0 / 4 solved

Question Tags Difficulty Success

1. Three Children Per Node

recursion-treedivide-and-conquer +1

Medium 55%

2. The Quadratic Combine

recurrencesdivide-and-conquer +1

Medium 40%

3. Minus One Not Half

recurrencesmaster-theorem +2

Medium —

4. Where The Log Vanishes

master-theoremrecursion-tree +1

Hard 33%

Learning Resources

Jeff Erickson, Solving Recurrences (notes)

Jeff Erickson, Recursion chapter

Master theorem (analysis of algorithms)

Up next

4 of 4 questions here are still unsolved.

Next module Amortized Analysis