Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked
 
PerlMonks  

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

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://931553]
help
Chatterbox?
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others making s'mores by the fire in the courtyard of the Monastery: (8)
As of 2017-11-20 22:21 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    In order to be able to say "I know Perl", you must have:













    Results (294 votes). Check out past polls.

    Notices?