Analysis Of Algorithm, Algorithms, Recursion, Recurrence Relation, Discrete Mathematics.
feel this is easier than you thought it could be. Conclusion: We learnt to analysize time complexity of recursive functions using Backward Substitution. Todo: As an exercise, try finding time complexity of the fibonacci function discussed in the previous chapter about building recurrence relations.