Made Easy Test Series:Algorithm-Recurrence Relation

Question

What is the solution of recurrence relation

$T\left ( n \right )=T\left ( n-1 \right )+n$

Answer 1

n+(n-1)+(n-2)+.....+1=$\frac{n \times (n+1)}{2}$

Comments

but here we donot know $T\left ( 1 \right )=1$

right??

---

Yes, it's an assumption. But unless the recurrence has a base case, it can't be solved.

---

O(n^2)

---

the solution of recurrence relation and time complexity of recurrence relation are 2 different things or the same??

---

Both are different things..

---

there is no such thing as "time complexity of recurrence relation".

Time complexity is related to algorithm means what is the running time of a particular algorithm for a given input size 'n'. To compute the running time,  we write the running time as recurrence if it has the recursive nature. The solution of that recurrence shows the time complexity of that algorithm.

Answer 2

We can use Master Theorem for Decreasing function here.

T(n) = a* T(n-b) + n^k

Here, a=1>0 , b=1>0 and k=1

so then, O(n^k+1) i.e O(n^2)   

Comments

Even if you solve manually you’ll get T(n)= n(n+1)/2

which is nothing but O(n^2)