Beefy Boxes and Bandwidth Generously Provided by pair Networks
Do you know where your variables are?

Re^2: Big O notation

by jettero (Monsignor)
on Oct 14, 2011 at 16:37 UTC ( #931553=note: print w/ replies, xml ) Need Help??

in reply to Re: Big O notation
in thread Big O notation

You could use a graphing calculator to show that's probably not true. n^2 log(n) will grow faster than log(n), as will n^2, so surely O(log(n)) can't be an upper bound for something that has n^2 log(n) in it. Maybe it was supposed to be n^(2 * log(n)) ... can't really tell. Probably homework anyway.

update: lol, figured

Comment on Re^2: Big O notation

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://931553]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others chanting in the Monastery: (4)
As of 2015-11-29 08:11 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (749 votes), past polls