solve the following recurrences by obtaining a ? bound for T(N) given that T(1) = ?(1):
T(N) = N + T(N-3)
I've done the solving i just can't find the pattern.
step 0) N+ T(N-3)
step 1) 2N-3+T(N-6)
step2) 3N -9+T(N-9)
step3) 4N-18 +T(N-12)
step4) 5N-30 +T(N-15)
step) 6N-45+T(N-18) .... and it goes on. I have to find a pattern meaning an equation that works for every value for k.
T(N) = N + T(N-3)
I've done the solving i just can't find the pattern.
step 0) N+ T(N-3)
step 1) 2N-3+T(N-6)
step2) 3N -9+T(N-9)
step3) 4N-18 +T(N-12)
step4) 5N-30 +T(N-15)
step) 6N-45+T(N-18) .... and it goes on. I have to find a pattern meaning an equation that works for every value for k.
