recurance problem

**transgalactic** · December 8th 2011, 01:43 AM

$T(n)=T(n-1)+\theta (n)$

i know that its algebric series but i dont know why?
how to solve it?

**chisigma** · December 8th 2011, 02:16 AM

The recursive relation can be written as...

$\Delta_{n}= t_{n+1}-t_{n}= \theta_{n}$ (1)

If the initial value $t_{0}$ is known, then the solution of (1) is...

$t_{n}=t_{0} + \sum_{k=0}^{n-1} \theta_{k}$ (2)

Kind regards

$\chi$ $\sigma$

**transgalactic** · December 8th 2011, 02:38 AM

the solution is $\theta (n^2)$

how to get this algebric series?

Thread: recurance problem

LinkBack

Thread Tools

Display

recurance problem

Re: recurance problem

Re: recurance problem

Search Tags