I want to show that if T(n) defined recursively as follows:
T(n) : c if n = 1
T (n) = T (n − 1) + nk if n > 1
then T(n) is O(nk+1), k>=0.
Please help me with this.......;(
CodeGuru Home | VC++ / MFC / C++ | .NET / C# | Visual Basic | VB Forums | Developer.com |
Results 1 to 2 of 2
Threaded View
|
Click Here to Expand Forum to Full Width |