760 views
2 votes
2 votes
T(N)=3T((N/3)+5)+N/2

what will be the time complexity?

Please log in or register to answer this question.

Related questions

0 votes
0 votes
2 answers
1
Arnab Bhadra asked Jun 30, 2017
1,972 views
Use recursion tree method to determine Upper Bound ofT(n) = T(n-1) + T(n/2) + n
0 votes
0 votes
1 answer
3
Parshu gate asked Sep 13, 2017
286 views
HOW ARE C1,C2 VALUES CALCULATED ?
0 votes
0 votes
3 answers
4
Anmol Verma asked Jan 9, 2017
1,463 views
1) T(n)=T(n-1)+1/n.2) T(n)=T(n-1) +1/log(n)3)T(n)=3T((n/3) - 2)+n/2.4)T(n)=T(n/2)+T(n/4)+T(n/8)+n.Use Masters theorem