# How to find complexity of T(n) = 8T(n/2)+n^2.93(log n)^93?

I believe we have to use a variant of master theorem...can someone suggest me how to find complexity of such equation which doesn't directly fit into Masters theorem.

• Good example here, if you actually want to use Master Theorem: stackoverflow.com/a/6094889 – Robert Harvey Mar 16 '16 at 22:40
• Otherwise... What is Big O and how do I calculate it? – Robert Harvey Mar 16 '16 at 22:41
• @RobertHarvey : I am unable to figure out the complexity for this..I felt the n^2.93(logn)^93 grows faster than n^3 but the answer is other way its O(n^3) is what i think – kranthi kumar Mar 16 '16 at 23:01
• Graph each one, using different values of `n`. – Robert Harvey Mar 16 '16 at 23:02
• Please edit your question to include a proper mathematical notation of the function. It is not clear how your exponents are parenthesized. – 5gon12eder Mar 17 '16 at 11:08

• Shouldn't your `=` be a `∈`? – CodesInChaos Mar 17 '16 at 10:58
• Sounds like a horrible idea. Especially in this case, since `o(n^2.93 * (log n)^93) ⊂ o(n^3)` and thus `o(n^2.93 * (log n)^93) ≠ o(n^3)`. – CodesInChaos Mar 17 '16 at 11:35