performance - which one has to consider for time complexity? -


nlog2n+3n^2+4n^3+n+10

from polynomial supposed consider either o(n^3) or o(logn) or other..

from log2n can have log2+logn right logn .like wise

what have consider please tell me?

in terms of time complexity, block has highest impact on output.

nlog2n+3n^2+4n^3+n+10 

in this, n^3 block has maximum impact of final output. big o deals upper bounds when value of n high. example, n=1

1log2(1) + 3(1*1) + 4(1*1*1) + 1 + 10  

clearly blocks contribute final value

but if n=100

1log2(100) + 3(100*100) + 4(100*100*100) + 100 + 10  

in this, n^3 have maximum impact.impact of remaining minimal compared n^3.

thus in case n^3 should considered time complexity.