What is the time complexity of the following equation

Question

I'm having a few problems working out the time complexity using Big-O notation.

This is the equation: 88n^2 logn + 81 + 3n^3 + 12n

I can figure it out I'm guessing its something like: O(n^2 logn) or O(n^3)

Thanks in advance.

i thought this i just needed a second opinion, thanks so much :) — ed-wright, Jan 10 '15 at 16:55
An equation doesn't have a time complexity (nor a space complexity). An algorithm does. — , Jan 10 '15 at 20:29
are you asking the time complexity of calculating that equation? If `n` is given, the time complexity will be `O(1)`. — nevets, Jan 11 '15 at 13:56
For an equation, there is a notable lack of equality signs. A function can be dominated by another, but does not have a time complexity. — greybeard, Jan 13 '15 at 04:50

score 1 · Accepted Answer · answered Jan 10 '15 at 17:51

1

As you know n grow faster than logn.

You also know we can multiply same strength factor to a complexity equation.

So we could simply say n^3 grow faster than n^2 logn.

=> O(n^3)

answered Jan 10 '15 at 17:51

Emadpres

score 0 · Answer 2 · answered Jan 13 '15 at 04:40

0

Since growth rate of n greater than the growth rate of log(n),

we can say n^3 grow faster than n^2 log(n).

So 88n^2 logn + 81 + 3n^3 + 12n => O(n^3)

answered Jan 13 '15 at 04:40

Deadlock

2 Answers2