Master

Theorem

CSE235 Master Theorem

Introduction

Pitfalls

Examples Slides by Christopher M. Bourke

4th Condition
Instructor: Berthe Y. Choueiry

Spring 2006

Computer Science & Engineering 235

Introduction to Discrete Mathematics
1 / 25
 Master Theorem I

Master
Theorem

CSE235

Introduction

Pitfalls When analyzing algorithms, recall that we only care about the
Examples asymptotic behavior.
4th Condition
Recursive algorithms are no different. Rather than solve exactly
the recurrence relation associated with the cost of an
algorithm, it is enough to give an asymptotic characterization.
The main tool for doing this is the master theorem.

2 / 25
 Master Theorem II

Master
Theorem

CSE235
Theorem (Master Theorem)
Introduction
Let T (n) be a monotonically increasing function that satisfies
Pitfalls

Examples T (n) = aT ( nb ) + f (n)

4th Condition
T (1) = c

where a ≥ 1, b ≥ 2, c > 0. If f (n) ∈ Θ(nd ) where d ≥ 0, then

 Θ(nd ) if a < bd


T (n) = Θ(n log n) if a = bd

d

Θ(nlogb a ) if a > bd


3 / 25
 Master Theorem
Pitfalls

Master
Theorem

CSE235

Introduction You cannot use the Master Theorem if

Pitfalls

Examples T (n) is not monotone, ex: T (n) = sin n

4th Condition
f (n) is not a polynomial, ex: T (n) = 2T ( n2 ) + 2n
√
b cannot be expressed as a constant, ex: T (n) = T ( n)

Note here, that the Master Theorem does not solve a

recurrence relation.
Does the base case remain a concern?

4 / 25
 Master Theorem
Example 1

Master
Theorem
n
+ 12 n2 + n. What are the parameters?


CSE235 Let T (n) = T 2
Introduction
a =
Pitfalls

Examples
b =
4th Condition
d =

Therefore which condition?

5 / 25
 Master Theorem
Example 1

Master
Theorem
n
+ 12 n2 + n. What are the parameters?


CSE235 Let T (n) = T 2
Introduction
a = 1
Pitfalls

Examples
b =
4th Condition
d =

Therefore which condition?

6 / 25
 Master Theorem
Example 1

Master
Theorem
n
+ 12 n2 + n. What are the parameters?


CSE235 Let T (n) = T 2
Introduction
a = 1
Pitfalls

Examples
b = 2
4th Condition
d =

Therefore which condition?

7 / 25
 Master Theorem
Example 1

Master
Theorem
n
+ 12 n2 + n. What are the parameters?


CSE235 Let T (n) = T 2
Introduction
a = 1
Pitfalls

Examples
b = 2
4th Condition
d = 2

Therefore which condition?

8 / 25
 Master Theorem
Example 1

Master
Theorem
n
+ 12 n2 + n. What are the parameters?


CSE235 Let T (n) = T 2
Introduction
a = 1
Pitfalls

Examples
b = 2
4th Condition
d = 2

Therefore which condition?

Since 1 < 22 , case 1 applies.

9 / 25
 Master Theorem
Example 1

Master
Theorem
n
+ 12 n2 + n. What are the parameters?


CSE235 Let T (n) = T 2
Introduction
a = 1
Pitfalls

Examples
b = 2
4th Condition
d = 2

Therefore which condition?

Since 1 < 22 , case 1 applies.
Thus we conclude that

T (n) ∈ Θ(nd ) = Θ(n2 )

10 / 25
 Master Theorem
Example 2

Master
Theorem
n

√
CSE235 Let T (n) = 2T 4 + n + 42. What are the parameters?
Introduction
a =
Pitfalls

Examples
b =
4th Condition
d =

Therefore which condition?

11 / 25
 Master Theorem
Example 2

Master
Theorem
n

√
CSE235 Let T (n) = 2T 4 + n + 42. What are the parameters?
Introduction
a = 2
Pitfalls

Examples
b =
4th Condition
d =

Therefore which condition?

12 / 25
 Master Theorem
Example 2

Master
Theorem
n

√
CSE235 Let T (n) = 2T 4 + n + 42. What are the parameters?
Introduction
a = 2
Pitfalls

Examples
b = 4
4th Condition
d =

Therefore which condition?

13 / 25
 Master Theorem
Example 2

Master
Theorem
n

√
CSE235 Let T (n) = 2T 4 + n + 42. What are the parameters?
Introduction
a = 2
Pitfalls

Examples
b = 4
4th Condition
d = 12

Therefore which condition?

14 / 25
 Master Theorem
Example 2

Master
Theorem
n

√
CSE235 Let T (n) = 2T 4 + n + 42. What are the parameters?
Introduction
a = 2
Pitfalls

Examples
b = 4
4th Condition
d = 12

Therefore which condition?

1
Since 2 = 4 2 , case 2 applies.

15 / 25
 Master Theorem
Example 2

Master
Theorem
n

√
CSE235 Let T (n) = 2T 4 + n + 42. What are the parameters?
Introduction
a = 2
Pitfalls

Examples
b = 4
4th Condition
d = 12

Therefore which condition?

1
Since 2 = 4 2 , case 2 applies.
Thus we conclude that
√
T (n) ∈ Θ(nd log n) = Θ( n log n)

16 / 25
 Master Theorem
Example 3

Master
Theorem
n
+ 34 n + 1. What are the parameters?


CSE235 Let T (n) = 3T 2
Introduction

Pitfalls
a =
Examples
b =
4th Condition d =

Therefore which condition?

17 / 25
 Master Theorem
Example 3

Master
Theorem
n
+ 34 n + 1. What are the parameters?


CSE235 Let T (n) = 3T 2
Introduction

Pitfalls
a = 3
Examples
b =
4th Condition d =

Therefore which condition?

18 / 25
 Master Theorem
Example 3

Master
Theorem
n
+ 34 n + 1. What are the parameters?


CSE235 Let T (n) = 3T 2
Introduction

Pitfalls
a = 3
Examples
b = 2
4th Condition d =

Therefore which condition?

19 / 25
 Master Theorem
Example 3

Master
Theorem
n
+ 34 n + 1. What are the parameters?


CSE235 Let T (n) = 3T 2
Introduction

Pitfalls
a = 3
Examples
b = 2
4th Condition d = 1

Therefore which condition?

20 / 25
 Master Theorem
Example 3

Master
Theorem
n
+ 34 n + 1. What are the parameters?


CSE235 Let T (n) = 3T 2
Introduction

Pitfalls
a = 3
Examples
b = 2
4th Condition d = 1

Therefore which condition?

Since 3 > 21 , case 3 applies.

21 / 25
 Master Theorem
Example 3

Master
Theorem
n
+ 34 n + 1. What are the parameters?


CSE235 Let T (n) = 3T 2
Introduction

Pitfalls
a = 3
Examples
b = 2
4th Condition d = 1

Therefore which condition?

Since 3 > 21 , case 3 applies. Thus we conclude that

T (n) ∈ Θ(nlogb a ) = Θ(nlog2 3 )

22 / 25
 Master Theorem
Example 3

Master
Theorem
n
+ 34 n + 1. What are the parameters?


CSE235 Let T (n) = 3T 2
Introduction

Pitfalls
a = 3
Examples
b = 2
4th Condition d = 1

Therefore which condition?

Since 3 > 21 , case 3 applies. Thus we conclude that

T (n) ∈ Θ(nlogb a ) = Θ(nlog2 3 )

Note that log2 3 ≈ 1.5849 . . .. Can we say that

T (n) ∈ Θ(n1.5849 ) ?

23 / 25
 “Fourth” Condition

Master
Theorem

CSE235 Recall that we cannot use the Master Theorem if f (n) (the
Introduction non-recursive cost) is not polynomial.
Pitfalls
There is a limited 4-th condition of the Master Theorem that
Examples
allows us to consider polylogarithmic functions.
4th Condition

Corollary
If f (n) ∈ Θ(nlogb a logk n) for some k ≥ 0 then

T (n) ∈ Θ(nlogb a logk+1 n)

This final condition is fairly limited and we present it merely for

completeness.

24 / 25
 “Fourth” Condition
Example

Master
Theorem

CSE235
Say that we have the following recurrence relation:
Introduction
n
Pitfalls
T (n) = 2T + n log n
Examples 2
4th Condition
Clearly, a = 2, b = 2 but f (n) is not a polynomial. However,

f (n) ∈ Θ(n log n)

for k = 1, therefore, by the 4-th case of the Master Theorem

we can say that
T (n) ∈ Θ(n log2 n)

25 / 25