Mathlib
Atlas
Atlas
/
Compute
/
Akra–Bazzi
Divide and conquer recurrences
1/4
A divide-and-conquer recurrence: T(n) = g(n) + Σ aᵢ T(⌊bᵢ n⌋).
T
(
n
)
=
g
(
n
)
+
∑
a
i
T
(
b
i
n
)
Replay
Challenge
Ask
depth
3