Time complexity1


#1

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


#2

First option I think !


#3

first is not correct


#4

tt1algo15a


#5

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


#6

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