The Master Theorem ·
T(n) = aT(n/b) + f(n)
un
seel
.com · Recursion tree · Leaf vs root · log
b
a
a / b
2 / 2
c = log
b
a
1.00
Case
—
Subproblem node
Combine work f(n)
Dominant level
Solved bound
▶ Play
←
→
🔇 Unmute
↻ Reset
Un
seel
.com · The Master Theorem