calculate time complexityof following recurrence relation

calculate time complexity

T(n)={  1. 20   ,                    if n=2

             2.  7T(n/2)+n2 ,          if n>2

6Comments
Sumit Verma @sumitkgp
2 May 2017 11:59 am

You can apply Master's theorem here.
a = 7, b = 2, k = 2, p = 0
Here a > bk.
So, Complexity =  θ(nlog27)

shweta @shweta1920
2 May 2017 12:25 pm

yes ,surely I can use masters theorem...but m having problem solving it using substitution method .. there are some steps which m unable to solve.. pls could u help in solving this question using substitution method?

Sumit Verma @sumitkgp
2 May 2017 01:55 pm
shweta @shweta1920
13 May 2017 11:41 am

thank u sir, can u plz help me out ? after u wrote summation of i (  (7/22 )i  i from 0 to logn-2 )..  after this step how theeta came into existence?

shweta @shweta1920
18 May 2017 01:01 pm

@sumitverma sir .. I have added one reply plz u reply to it .. and u told ull make vedio for gate2017 solutions .. where is it????

Sumit Verma @sumitkgp
22 May 2017 12:08 pm

@shweta1920, we are working on that. Sorry for the delay.