How to solve the following recurrence relation? T(n) = T(n-6) + n2 , n>7 T(n) = 1 , n<= 7
using substitution method
you will get o(n3)
@adarsh @goxul
i got T(n)=1+132+192+252+............+n2
if it is right how to solve it further or if it is wrong then what is right ??
64.3k questions
77.9k answers
244k comments
80.0k users