$$T(n) = 2 T(n/2) + \sum_{k=0}^n (k+2)^2$$ I want to use the substitution method. How can I generate my guess and how can I determine the growth of summation in the recurrence?
Asked
Active
Viewed 13 times
0
-
2How on earth did you think that [tag:computer-architecture] was appropriate here? I'm honestly curious. – Raphael Sep 29 '17 at 17:40
-
Welcome to Computer Science! What have you tried? Where did you get stuck? We do not want to just hand you the solution; we want you to gain understanding. However, as it is we do not know what your underlying problem is, so we can not begin to help. See here for tips on asking questions about exercise problems. If you are uncertain how to improve your question, why not ask around in [chat]? – Raphael Sep 29 '17 at 17:40
-
Hint: Simplify the sum. Then use standard methods. – Raphael Sep 29 '17 at 17:40