๐ Master Theorem Calculator
Solve recurrences of the form T(n) = aT(n/b) + f(n)
T(n) =
a
ยท T(n/
b
) + n
d
a (subproblems)
Number of recursive calls
b (shrink factor)
Divide problem by b
d (work exponent)
f(n) = n
d
Solution Steps:
Result:
ฮ(n log n)
Case 1: Leaves Win
If d < log
b
a
Then T(n) = ฮ(n
log
b
a
)
Case 2: Tie
If d = log
b
a
Then T(n) = ฮ(n
d
log n)
Case 3: Root Wins
If d > log
b
a
Then T(n) = ฮ(n
d
)