1. ## Using big-O notation

How can I re-express the below thress functions of algorithm complexity using the big-O notation?

12
2n^2 + 3 n
5 n lg n + 4 n 2. I havent studied complexity theory formally yet, but my guesses:

12 => O(1)
2n^2 + 3 n => O(n^2)
5 n lg n + 4 n => O(n log n) 3. I think that the third one is O(n), but I'm not sure. 4. ## this sounds like homework =d

I'm taking a theory of algorithms class ...
yeah the third one should be O(nlgn) since the nlgn part grows faster than the linear part. You always want to take the big O of what grows the fastest.. for example
n + n^3 would be O(n^3)

the first one is constant time so that is O(1) and the second one is quadratic time, O(n²) .. to be more precise there is also a theta function (for example while O(n) means the function is less than some constant times n, theta(n) means the function is just about the same as n. That's probably more detail then you needed so stick to
O(1)
O(n²) and
O(nlgn) 5. You can take a quick limit to see which grows faster. That is, (n * lg n) / n = lg n which is unbounded as n grows. So, O(n lg n) > O(n). 6. In general, take the highest order term in the polynomial, strip its coeficient and thats the Big-O efficiency. Remember, logarithms are exponents (inverse though) so this also applies for them. 7. for the third '5 n lg n + 4 n'

since nlgn<n2<n3

f(n)=5 n lg n + 4 n < 5(n3)+4n
=19n

am I correct? 8. hmm... I dont understand your reasoning.
f(n) is 5n lg n + 4n 9. n3 should be n^3... That is, n cubed, not three times n Popular pages Recent additions 