Time complexity1


Find the time complexity of following recurrence relation?
T(n) = 5T(n-47) + O(1) and
A) O(n)
B) O(log n)
C) O(5^n)


First option I think !


first is not correct




Or you can directly use masters theorem for substract and conquer . (you can get answer faster)


here case3 use ,
my doubt is what is n value? when we use n^k a^(n/b)