Computer Science, asked by jenishapatel1131, 24 days ago

2. Using Substitution method, solve the following recurrence
T(n) = T(n-2) + n² if n>0
1 if n=0
T(n) = T(n-2) + logn if n>0
1 if n=0
T(n) = 2T (0/2) + n²​

Answers

Answered by vasugaya2
0

Answer:

Using Substitution method, solve the following recurrence

T(n) = T(n-2) + n² if n>0

1 if n=0

T(n) = T(n-2) + logn if n>0

1 if n=0

T(n) = 2T (0/2) + n²

Similar questions