Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery
 
PerlMonks  

Re: An informal introduction to O(N) notation

by fruiture (Curate)
on Jan 18, 2003 at 12:09 UTC ( #227954=note: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
      f(n,m,...) = O(g(n,m,...))
    means that there exists a constant "c", for which
      c * g(n,m,...) >= f(n,m,...)
    is true for large enough n,m,...
    
  2. or download this
       f(n,m,...) = Ω(g(n,m,...)
    means that there is ....
       c * g(n,m,...) <= f(n,m,...)
    
  3. or download this
     f(n,m,...) = &Theta;(g(n,m,...))
    means that
      f(n,m,...) = O( g(n,m,...) )
    and
      f(n,m,...) = &Omega;( g(n,m,...) )
    

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://227954]
help
Chatterbox?
[thezip]: G'day!

How do I use this? | Other CB clients
Other Users?
Others exploiting the Monastery: (7)
As of 2017-01-19 19:40 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Do you watch meteor showers?




    Results (170 votes). Check out past polls.