Beefy Boxes and Bandwidth Generously Provided by pair Networks
go ahead... be a heretic

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,...) )
      f(n,m,...) = &Omega;( g(n,m,...) )

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://227954]
[robby_dobby]: ambrus: Yes
[hippo]: erix++: "the browser ate my code"
[robby_dobby]: Eily: Now, people are trying to be inventive with crowdsourcing their work, eh? Sure, call on the admins to k-line these sockpuppet accounts!
[robby_dobby]: hippo: I like how you equated your browser to a dog....
[Eily]: well, Anonymonk is everyone's sockpuppet :D

How do I use this? | Other CB clients
Other Users?
Others avoiding work at the Monastery: (9)
As of 2017-04-25 13:16 GMT
Find Nodes?
    Voting Booth?
    I'm a fool:

    Results (454 votes). Check out past polls.