Scribd
Upload
17 views1 page

Master

The document defines a recurrence relation T(n) = aT(n/b) + f(n) where a ≥ 1, b ≥ 2, c > 0. It states that if f(n) is O(nd) for d ≥ 0, then: 1) T(n) is O(nd) if a < bd 2) T(n) is O(nd log n) if a = bd 3) T(n) is O(nlogba) if a > bd

Uploaded by

Saint-Clair Lima
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
17 views1 page

Master

The document defines a recurrence relation T(n) = aT(n/b) + f(n) where a ≥ 1, b ≥ 2, c > 0. It states that if f(n) is O(nd) for d ≥ 0, then: 1) T(n) is O(nd) if a < bd 2) T(n) is O(nd log n) if a = bd 3) T(n) is O(nlogba) if a > bd

Uploaded by

Saint-Clair Lima
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

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

You might also like