Analysis Of Algorithm, Algorithms, Recursion, Recurrence Relation, Discrete Mathematics.
Therefore n = K. If we put n = K in equation 6, we get: T(n) = T(n-n)+n .: T(n) = T(0) + n Since we know, T(0) = 1 from our base case, we can say: T(n) = 1+n And asymptotically T(n) = O(n) Now trust me, this is simple. Just lengthy at start. But go through this once again. I am sure you’ll also