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.......;(
Printable View
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.......;(
I mean O(n^k+1)