Register

recurrence relation by recursion tree

166 views
1 votes
1 votes
How to solve the recurrence relation either by recursion tree or back substitution

T(n)=  O(1) ,  if n<=80

        = T(n/5)+T(7/10n +6) + O(n)   if n>80
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
2 answers
1
iarnav asked Mar 30, 2018
2,461 views
#Algorithms Solve this recurrence equation only by using Recursion Tree method
T(n) = 2T(n/2) + C
T(n) = 2T(n/2) + C
User Avatar
3 votes
3 votes
2 answers
4
Diksha Aswal asked Jul 3, 2017
1,916 views
Recurrance Relation-Recursion Tree
T(n) = T(n/3)+T(2n/3)+n What is the solution of Above Given recurrence relation? Give full method to solve this
T(n) = T(n/3)+T(2n/3)+n What is the solution of Above Given recurrence relation?Give full method to solve this
User Avatar
Link Copied!