Let T(n) be an eventually non-decreasing function that satisfies the recurrence

T(n) = aT (n/b) + f(n) for n = b

k
, k = 1, 2, . . .
T(1) = c,

where a1, b2, c>0.

If f(n)=O(n
d
) where d0, then















Let T(n) be an eventually non-decreasing function that satisfies the recurrence
T(n) = aT (n/b) + f(n) for n = b
k
, k = 1, 2, . . .
T(1) = c,

where a1, b2, c>0.

If f(n)=O(n
d
) where d0, then















Let T(n) be an eventually non-decreasing function that satisfies the recurrence
T(n) = aT (n/b) + f(n) for n = b
k
, k = 1, 2, . . .
T(1) = c,

where a1, b2, c>0.

If f(n)=O(n
d
) where d0, then










{
T(n) =
O(n
d
)
O(n
d
log n)
O(n
log
b
a
)
if a < b
d

if a = b
d

if a > b
d



{
T(n) =
O(n
d
)
O(n
d
log n)
O(n
log
b
a
)
if a < b
d

if a = b
d

if a > b
d



{
T(n) =
O(n
d
)
O(n
d
log n)
O(n
log
b
a
)
if a < b
d

if a = b
d

if a > b
d