IntroductiontoAlgorithms3rdEdSolutions
Sunday, January 20, 2013
7.2-1
Use the substitution method to prove that the recurrence $T(n) = T(n -1)+\theta(n)$ has the solution $T(n)=\theta(n^2)$, as claimed at the beginning of Section 7.2.
refer to 4.3-1.
No comments:
Post a Comment
‹
›
Home
View web version
No comments:
Post a Comment