Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical

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]
[Discipulus]: to specify use 5.0.x to be sure to have pairmap from the module..
[Corion]: Discipulus: I think Module::Corelist ( or corelist ) can tell you that
[Corion]: Meh - Module::CoreList
[choroba]: Just use List::Util 1.29
[choroba]: Be kind to people using old Perl with newer version of the module
[Corion]: But why not simply specify 'List::Util' => 1.29 in your prerequisites? People might install a more recent version of the module into their Perl
[Corion]: (what choroba said)

How do I use this? | Other CB clients
Other Users?
Others chanting in the Monastery: (6)
As of 2017-05-25 09:19 GMT
Find Nodes?
    Voting Booth?