Register

SOLVING RECURRENCE RELATION BY BACK SUBSTITUTION

• retagged by
3,401 views

2 Answers

Best answer
2 votes
2 votes

Answer
Correct me if I am wrong

• selected by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
aka 53 asked Nov 21, 2017
1,598 views
Algo Recurrence Relation using Bck Substitution
T(n) = 4T(n/2) + C ......where C Constant T(n) = 16T(n/4) + 5C Cant figure out how to generalize and compare with base condition T(n) = 1 from above step.
T(n) = 4T(n/2) + C ......where C ConstantT(n) = 16T(n/4) + 5CCant figure out how to generalize and compare with base condition T(n) = 1 from above step.
User Avatar
1 votes
1 votes
2 answers
2
Himanshu Goyal asked Oct 12, 2016
1,242 views
What will be the time complexity of recurrence relation T(n)=c+T(n-1) using substitution method?
What will be the solution of the recurrence relation $T(n)=c+T(n-1)$ using substitution method? c is a constant here.
What will be the solution of the recurrence relation $T(n)=c+T(n-1)$ using substitution method?c is a constant here.
User Avatar
5 votes
5 votes
1 answer
3
piyushkr asked Dec 23, 2015
5,092 views
What will be the time complexity of recurrence relation T(n)=2T(n-1)+c using substitution method?
Where c is constant.
Where c is constant.
User Avatar
1 votes
1 votes
0 answers
4
PEKKA asked Dec 6, 2016
2,949 views
Solve the recurrence using back substitution method
Solve the following Recurrence Equation using back substitution method T(n)= 2T(n/2)+log n​
Solve the following Recurrence Equation using back substitution method T(n)= 2T(n/2)+log n​
User Avatar
Link Copied!