What is the complexity of the following recurrence :
7T(n/2) + an^2
How to calculate the time complexity from this?
Its complexity would be theta(n^log7). Here log7 has base 2
To calculate such recurrences, study master method of solving recurrences and its cases
It is used to solve recurrences of the form T(n)=aT(n/b)+f(n)
where f(n) is of the form n^klog^p(n).
Here in this case,k=2 and p=0.
I know it is sounding tough but once you remember the cases, such recurrences are easiest to solve.
1 Like
Hey Anikash
If your query is resolved then please mark it resolved from your end 
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.