Analysis Of Algorithm, Algorithms, Recursion, Recurrence Relation, Discrete Mathematics.
base case before K th recursion step: Therefore, we can deduce that: T(n) = T(n-K)+K ... Let's call this equation 6 Now, since our base case is: when n = 0: T(n) = 1 In other words, T(0) = 1 we can assume that n, n-1, n-2, n-3, ..., n-(k-2), n-(k-1), n-k has reached 0. So we can say n — K = 0.