Big-Θ notation: Difference between revisions

From LifeWiki
Jump to navigation Jump to search
Add other asymptotic notations
m Removed typo
Line 29: Line 29:
*Small omega notation: <tt>f(n)</tt> is <tt>ω(g(n))</tt> if <tt>f</tt>'s growth is greater than <tt>g</tt>'s
*Small omega notation: <tt>f(n)</tt> is <tt>ω(g(n))</tt> if <tt>f</tt>'s growth is greater than <tt>g</tt>'s
::<tt>lim<sub>n->∞</sub>(f(n)/g(n))=∞</tt>
::<tt>lim<sub>n->∞</sub>(f(n)/g(n))=∞</tt>
With these definitions, <tt>f(n)=Θ(g(n))</tt> {{iff}} <tt>f(n)=O(g(n))</tt> and <tt>f(n)=Ω(g(n))</tt>, in the same manner that <tt>x=y</tt> iff <tt>x&le;y</tt> and <tt>x&ge;y</tt>.
With these definitions, <tt>f(n)=Θ(g(n))</tt> {{iff}} <tt>f(n)=O(g(n))</tt> and <tt>f(n)=Ω(g(n))</tt>, in the same manner that <tt>x=y</tt> if <tt>x&le;y</tt> and <tt>x&ge;y</tt>.


==Notes==
==Notes==

Revision as of 17:05, 12 August 2023

Big-Θ notation (or big theta notation) is used to describe the growth rate of a pattern when the actual formula f(t)[note 1] for the growth is complex but, over time, becomes effectively the same as a simpler formula g(t). It is said that f(t) is proportional to g(t) or, even more simply, the pattern grows like g(t). This is expressed in big-Θ notation as f(t) is Θ(g(t)). In essence, g sheds details of f which might otherwise obscure understanding of what happens as t gets large.

For example, the population of the spacefiller max, p(t), can be expressed as follows:

  • p(t)=t2/4+21t/2+209, if t ≡ 0 (mod 4)
  • p(t)=t2/4+21t/2+215, if t ≡ 2 (mod 4)
  • p(t)=t2/4+10t+923/4 otherwise

As t gets large, the t2/4 term dominates. In other words, the population of max grows like t2/4, or p(t) is Θ(t2) or p(t) is Θ(t2/4).

Other asymptotic notations

See also Limit inferior and limit superior and big O notation at Wikipedia
  • infm≥n (f(m)): f's minimum over all inputs greater than or equal to n.
  • supm≥n (f(m)): like inf but f's maximum instead.

Where they are defined (when limits of functions' minima and maxima exist), inf is a strictly increasing function of n, and sup a strictly decreasing one.

  • lim infn->∞ (f(n)), lim supn->∞ (f(n)): The limit that inf and sup approach when evaluated on arbitrarily large inputs.

These may be used to rigorously define the other notations.

  • Small O notation: f(n) is o(g(n)) if f's growth is less than g's
limn->∞(f(n)/g(n))=0
  • Big O notation: f(n) is O(g(n)) if f's growth is less than or equal to g's
lim supn->∞(f(n)/g(n))<∞
The limit may be finite or zero.
  • Big omega notation: f(n) is Ω(g(n)) if f's growth is greater than or equal to g's
lim infn->∞(f(n)/g(n))>0
The limit may be finite or infinite.
  • Small omega notation: f(n) is ω(g(n)) if f's growth is greater than g's
limn->∞(f(n)/g(n))=∞

With these definitions, f(n)=Θ(g(n)) iff f(n)=O(g(n)) and f(n)=Ω(g(n)), in the same manner that x=y if x≤y and x≥y.

Notes

  1. ↑ t is the number of ticks that the pattern has been run

Further reading