359 views

1 Answer

1 votes
1 votes
It is only applicable when Base condition is True for given Recurrence Relation.

Master theorem can apply to any recurrence relation if it has following format,

$T \left ( n \right ) = a T \left ( \frac{n}{b} \right ) + n^{k}log^{p}n$

where, $a \geqslant 1, b > 1, k \geqslant 0$

and P is read number.

Related questions

0 votes
0 votes
0 answers
2
jatin khachane 1 asked Dec 1, 2018
312 views
T(n)=4T(√n)+nHow can we solve it using master theorem using subsitution and renaming.
0 votes
0 votes
2 answers
3
Verma Ashish asked Sep 19, 2018
748 views
How to solve the given recurrence relation using master's theorem?T(n)=T(${n^{1/2}}$)+n
0 votes
0 votes
0 answers
4
hitendra singh asked Aug 8, 2018
770 views
consider the following c program AA(n){ if(n<=1) return (n2+n+1);else return ( 5A(n/2)+ 3A(n/2)+n2}find time complexity T(n)=?