Solve the Recurrence

Question

T(n) =2 T$(\frac{n}{4})$ - n²

Comments

f(n) is not positive -> Masters theorem cannot be applied..... but could be solved by tree and substitution method!

---

T (n) = 2T (n/2) + n/ log n

Another example ..that can't be solved by masters theorem because of non-polynomial difference between f(n) and  

Answer 1

By masters and Substitution

Answer is Theta(n^2)

 

please update me, if there is some other answer.

Comments

if you are substitituing then please tell what guess and how you made and how you solved?

---

i dont know about  my solution, please update if u found anything wrong

---

I think after solving this recurrence relation  the relation will be n^1/2 - n^2