Akra–Bazzi Theorem Solver
Enter a divide-and-conquer recurrence of the form
T(n) = ∑ aᵢ·T(⌊n/bᵢ⌋) + c·n^k (log n)^m
a_i (comma-separated)
Positive coefficients of recursive terms.
b_i (comma-separated)
Each > 1, same count as aᵢ.
c
Constant factor for g(n).
k (power of n)
g(n) includes n^k.
m (power of log n)
g(n) includes (log n)^m (use 0 for none).
Solve
Example preset (already filled): T(n) = 2·T(⌊n/2⌋) + n → solution Θ(n log n).