717 views
0 votes
0 votes

consider  the following c program A

A(n)

{ if(n<=1)

   return (n2+n+1);

else return ( 5A(n/2)+ 3A(n/2)+n2

}

find time complexity T(n)=?

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
jatin khachane 1 asked Dec 1, 2018
296 views
T(n)=4T(√n)+nHow can we solve it using master theorem using subsitution and renaming.
0 votes
0 votes
2 answers
2
Verma Ashish asked Sep 19, 2018
715 views
How to solve the given recurrence relation using master's theorem?T(n)=T(${n^{1/2}}$)+n
0 votes
0 votes
1 answer
3
Venkat Sai asked Nov 3, 2017
340 views
can masters theorem be used when base condition is given in a recurrence ?can we directly apply masters theorem to any recurrence ?