Why is it o(n^2.81)?

What is the complexity of the following recurrence :
7T(n/2) + an^2

What will be the time complexity of the following recurrence relation: 3T(n/3)+ √n . Why is it O(n)???

hello @gaganpreetsachdev1
image

image

use master theorm for this recurrence.

o(n^log7 + n^2) should be o(n^2) since you take the larger one as time complexity right?

no
log2(7) is 2.8 that s why ignored n^2

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.