832 views
1 votes
1 votes
how to compute time complexity of this kind of recurrence relation-

T(n)=T(n/2)+T(n/4)+T(n/8)+n

1 Answer

0 votes
0 votes

You need to draw recursion tree to solve these type of questions.

Please verify!! 

Related questions

0 votes
0 votes
0 answers
1
garvit_vijai asked Nov 17, 2018
448 views
How to solve the following recurrence relation?T(n) = T(n-6) + n2 , n>7T(n) = 1 , n<= 7
2 votes
2 votes
1 answer
2
Manu Thakur asked Aug 18, 2017
1,391 views
Can you please solve this following question further?What will be the time complexity?