Question #190687

Solve the following recurrence relation using recurrence tree and iteration methods

T(n) = T(n-1) + n




1
Expert's answer
2021-05-19T14:58:22-0400

 recurrence tree

t(n) n

t(n-1) n-1

t(n-2) n-2

...

t(1) 1

t(n)=i=1ni=n(n+1)2t(n)=\sum\limits_{i=1}^n i=\frac{n(n+1)}{2}

iteration methods

t(n)=n+t(n1)=n+(n1)+t(n2)=...=i=1ni=n(n+1)2t(n)=n+t(n-1)=n+(n-1)+t(n-2)=...=\sum\limits_{i=1}^{n}i=\frac{n(n+1)}{2}


Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Comments

No comments. Be the first!
LATEST TUTORIALS
APPROVED BY CLIENTS