##### calculate time complexityof following recurrence relation

calculate time complexity

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

2. 7T(n/2)+n^{2 , } if n>2

calculate time complexity

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

2. 7T(n/2)+n^{2 , } if n>2

You can apply Master's theorem here.

a = 7, b = 2, k = 2, p = 0

Here a > b

^{k}.So, Complexity = θ(n

^{log27})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?

@shweta1920

thank u sir, can u plz help me out ? after u wrote summation of i ( (7/2

^{2})^{i}i from 0 to logn-2 ).. after this step howtheetacame into existence?@sumitverma sir .. I have added one reply plz u reply to it .. and u told ull make vedio for gate2017 solutions .. where is it????

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