This preview shows page 1. Sign up to view the full content.
Unformatted text preview: T ( n ) is Θ(1) for n ≤ 4. (a) T ( n ) = √ 2 · T ( n/ 2) + √ n . (b) T ( n ) = 3 · T ( n/ 2) + n/ lg n . (c) T ( n ) = T ( n/ 2) + T ( n/ 3) + n . Problem 3. (12 pts) Is 2 n 2 + 5 n-8 = O ( n 2 ) correct? Disprove the statement, or prove it by determining the smallest integer constant c and then the smallest integer constant n in the deﬁnition of O-notation....
View Full Document
This note was uploaded on 01/01/2011 for the course EE 5503 taught by Professor Yao-wenchang during the Fall '09 term at National Taiwan University.
- Fall '09
- Electrical Engineering