Using the master theorem

Use the mas开发者_运维问答ter theorem to put O() bounds on this statement:

T(n) = 16T(n/4) + n2 + log n

I'm trying to understand the master theorem more and more and trying to find more examples online and getting their solutions.

I think this resource is enough for this question

T(n)=16T(n/4)+n^2+log n ==> T(n)=16T(n/4)+n^2. Because n^lg16=n^2 the result is o(n^2 log n)