Big-O...

[netP]

Hi,

I am currently writing C++ for my class project. I realize that my codes run with 2*m*n^3 - n^3. I wonder can I said that Big-O of my algorithm is 2*m*n^3. I am not quite sure because both terms have a power of 3 for n.

Thanks,

[helios]

It's O(n^k), or polynomial. Big O notation only gives an approximate rate of growth. n^2 or n^3 doesn't make much difference. Both functions grow rapidly.