Analysis Of Algorithm, Algorithms, Recursion, Recurrence Relation, Discrete Mathematics.
recursion: T(n) = T(n-2)+2 Before 3rd recursion: T(n) = T(n-3)+3 . . . . We can easily deduce that before 4th recursion: T(n) = T(n-4)+4 . . . And before 5th recursion: T(n) = T(n-5)+5 . . . And so on till we reach out base case... Let’s assume we reached out base case: Now let’s say we reach the