1

CS 570 (Spring 2008) Notes #4

Hing Leung

Solve for the recurrence T (n) = 2T (n/2) + n.

T (n) = T (2k )
= 2T (2k−1 ) + 2k
= 22 T (2k−2 ) + 2 2k−1 + 2k
= 22 T (2k−2 ) + 2 2k
= 23 T (2k−3 ) + 22 2k−2 + 2 2k
= 23 T (2k−3 ) + 3 2k
= 24 T (2k−4 ) + 4 2k
·
·
·
= 2k T (2k−k ) + k 2k
= 2k Θ(1) + k 2k
= Θ(k 2k )
= Θ(n lg n)

(Problem 4-1(d), page 85 of the textbook) T (n) = 7T (n/3) + n2

T (n) = T (3k )
= 7T (3k−1 ) + 32k
= 72 T (3k−2 ) + 7 32k−2 + 32k
= 72 T (3k−2 ) + (7/9)32k + 32k
= 73 T (3k−3 ) + 72 32k−4 + (7/9)32k + 32k
= 73 T (3k−3 ) + (7/9)2 32k + (7/9)32k + 32k
= 73 T (3k−3 ) + ((7/9)2 + (7/9) + 1)32k
= 74 T (3k−4 ) + ((7/9)3 + (7/9)2 + (7/9) + 1)32k
·
·
·
= 7k T (3k−k ) + ((7/9)k−1 + . . . + (7/9)2 + (7/9) + 1)32k
= 7k Θ(1) + 32k Θ(1)
= 7k Θ(1) + 9k Θ(1)
= 9k Θ(1)
= Θ(32k )
= Θ((3k )2 )
= Θ(n2 )
Hing Leung 2

Another way to solve the recurrence T (n) = 7T (n/3) + n2 is to assume

T (1) = 1.
T (n) = T (3k )
= 7T (3k−1 ) + 32k
= 72 T (3k−2 ) + 7 32k−2 + 32k
= 72 T (3k−2 ) + (7/9)32k + 32k
= 73 T (3k−3 ) + 72 32k−4 + (7/9)32k + 32k
= 73 T (3k−3 ) + (7/9)2 32k + (7/9)32k + 32k
= 73 T (3k−3 ) + ((7/9)2 + (7/9) + 1)32k
= 74 T (3k−4 ) + ((7/9)3 + (7/9)2 + (7/9) + 1)32k
·
·
·
= 7k T (3k−k ) + ((7/9)k−1 + . . . + (7/9)2 + (7/9) + 1)32k
= ((7/9)k + (7/9)k−1 + . . . + (7/9)2 + (7/9) + 1)32k
= Θ(1)32k
= Θ((3k )2 )
= Θ(n2 )

Solve for the recurrence T (n) = 9T (n/2) + n3 .

T (n) = T (2k )
= 9T (2k−1 ) + 23k
= 92 T (2k−2 ) + 9 23(k−1) + 23k
= 93 T (2k−3 ) + 92 23(k−2) + 9 23(k−1) + 23k
= 94 T (2k−4 ) + 93 23(k−3) + 92 23(k−2) + 9 23(k−1) + 23k
·
·
·
= 9k T (2k−k ) + 9k−1 23 + . . . + 92 23(k−2) + 9 23(k−1) + 23k
= 9k Θ(1) + 9k ((8/9) + (8/9)2 + (8/9)3 + . . . + (8/9)k )
= 9k Θ(1) + 9k Θ(1)
= Θ(9k )
= Θ(9lg n )
= Θ(nlg 9 )
Hing Leung 3

Solve for the recurrence T (n) = 2T (n/2) + n lg n.

T (n) = T (2k )
= 2T (2k−1 ) + k 2k
= 22 T (2k−2 ) + 2(k − 1)2k−1 + k 2k
= 22 T (2k−2 ) + (k − 1)2k + k 2k
= 23 T (2k−3 ) + 22 (k − 2)2k−2 + (k − 1)2k + k 2k
= 23 T (2k−3 ) + (k − 2)2k + (k − 1)2k + k 2k
·
·
·
= 2k T (2k−k ) + (1 + 2 + 3 + . . . + (k − 2) + (k − 1) + k)2k
= 2k Θ(1) + (k(k + 1)/2) 2k
= 2k Θ(1) + (1/2)k 2 2k + (1/2)k 2k
= Θ(k 2 2k )
= Θ(n(lg n)2 )