recurrence relation for the following algorithm, and then find the time complexity using substitution method

Malladugu C 0
Viewed 22

T(n)= 2T(n-2) +n^2 ??

Find the recurrence relation for the following algorithm, and then find the time complexity using the substitution method.

how to solve this recurrence relation using the substitution method?

recurrence data-structures algorithm
0 Answers
Related