Unformatted text preview: relations. T (1) = 3 , T (2) = 7 , and T ( n ) ≤ T ( b n/ 2 c ) + T ( d n/ 6 e + 1) + 3 n, for n ≥ 3 (a) What is max { T ( n ) /n : 1 ≤ n ≤ 200 } ? You do not have to prove your answer is correct. (b) Give a careful proof that T ( n ) ∈ O ( n ). Hint: The Master Theorem does not apply to T . 1...
View
Full Document
 Winter '16
 Algorithms, Englishlanguage films, Computational complexity theory, Recursive Algorithm, Willemina

Click to edit the document details