BuildTree Analysis (Exact)

Precise Analysis: T(0) = b

T(n) = T( ) + T( ) + c

By induction on n:

T(n) = (b+c)n + b

Base case:

T(0) = b = (b+c)0 + b

Induction step:

T(n) = (b+c) + b +

(b+c) + b + c

= (b+c)n + b

QED: T(n) = (b+c)n + b = ??(n)

Previous slide

Next slide

Back to first slide

View graphic version