Big O notation

Poll without page-refresh

Article on other languages:

	del.icio.us
	Digg
	Furl
	Reddit
	Rojo
	Add to OnlyWire

This article may require cleanup to meet Wikipedia's quality standards.
Please improve this article if you can. (April 2008)

This article is about the mathematical notation. For other uses, see Big O.

In mathematics, big O notation (so called because it uses the symbol O) describes the limiting behavior of a function for very small or very large arguments, usually in terms of simpler functions. It is also called Big Oh notation, Landau notation, Bachmann-Landau notation, and asymptotic notation. There are also other symbols o, Ω, ω, and Θ for related bounds.

Although developed as a part of pure mathematics, it is now frequently also used in computational complexity theory to describe how the size of the input data affects an algorithm's usage of computational resources (usually running time or memory). Big O notation is also used in many other scientific and mathematical fields to provide similar estimates.

History

The notation was first introduced by number theorist Paul Bachmann in 1894, in the second volume of his book Analytische Zahlentheorie ("analytic number theory"), the first volume of which (not yet containing big O notation) was published in 1892.^[1] The notation was popularized in the work of a German Jewish number theorist Edmund Landau; hence it is sometimes called a Landau symbol. The big-O, standing for "order of", was originally a capital omicron; today the identical-looking Latin capital letter O is also used, but never the digit zero.

Formal definition

Suppose $f (x)$ and $g (x)$ are two functions defined on some subset of the real numbers. We say

Theory of O-Notation: f is in the order of g (i.e.

f (x) = O (g (x))

) if and only if there exists a positive real number M and a real number

x 0

such that for all x, $|f(x)|\le M\cdot g(x)$ , wherever

x > x 0

$f(x)=O(g(x))\mbox{ as }x\to\infty$

if and only if there exists a positive real number M and a real number $x 0$ such that $|f(x)| \le \; M |g(x)|$ for $x > x 0 .$

The notation can also be used to describe the behavior of f near some real number a: we say $f(x)=O(g(x))\mbox{ as }x\to a$ if and only if there exist positive numbers δ and M such that

$|f(x)| \le \; M |g(x)|\mbox{ for }|x - a| < \delta.$

If $g (x)$ is non-zero for values of x sufficiently close to a, both of these definitions can be unified using the limit superior:

$f(x)=O(g(x))\mbox{ as }x \to a$

if and only if

$\limsup_{x\to a} \left|\frac{f(x)}{g(x)}\right| < \infty.$

Usage

Big O notation has two main areas of application. In mathematics, it is commonly used to describe how closely a finite series approximates a given function, especially in the case of a truncated Taylor series or asymptotic expansion. In computer science, it is useful in the analysis of algorithms. In both of the applications, the function g(x) appearing within the O(...) is typically chosen to be as simple as possible, omitting constant factors and lower order terms.

There are two formally close, but noticeably different, usages of this notation: infinite asymptotics and infinitesimal asymptotics. This distinction is only in application and not in principle, however—the formal definition for the "big O" is the same for both cases, only with different limits for the function argument.

Infinite asymptotics

Big O notation is useful when analyzing algorithms for efficiency. For example, the time (or the number of steps) it takes to complete a problem of size n might be found to be T(n) = 4n² − 2n + 2.

As n grows large, the n² term will come to dominate, so that all other terms can be neglected — for instance when n = 500, the term 4n² is 1000 times as large as the 2n term. Ignoring the latter would have negligible effect on the expression's value for most purposes.

Further, the coefficients become irrelevant as well if we compare to any other order of expression, such as an expression containing a term n³ or n². Even if T(n) = 1,000,000n², if U(n) = n³, the latter will always exceed the former once n grows larger than 1,000,000 (T(1,000,000) = 1,000,000³ = U(1,000,000)). Additionally, the number of steps depends on the details of the machine model on which the algorithm runs, but different types of machines typically vary by only a constant factor in the number of steps needed to execute an algorithm.

So the big O notation captures what remains: we write either

T (n) = O (n 2)

$T(n)\in O(n^2)$

(read as "big o of n squared") and say that the algorithm has order of n² time complexity.

Note that "=" is not meant to express "is equal to" in its normal mathematical sense, but rather a more colloquial "is", so the second expression may be more accurate (see the "Equals sign" discussion below).

Infinitesimal asymptotics

Big O can also be used to describe the error term in an approximation to a mathematical function. For example,

$e^x=1+x+\frac{x^2}{2!}+O(x^3)\qquad\hbox{as}\ x\to 0$

expresses the fact that the error, the difference $e^x - \left(1 + x +\frac{x^2}{2!}\right)$ , is smaller in absolute value than some constant times $\left|x^3\right|$ when $x$ is close enough to 0.

Example

Take the polynomials:

$f(x) = 6x^4 -2x^3 +5 \,$

$g(x) = x^4. \,$

We say f(x) has order O(g(x)) or O(x⁴) (as $x\to\infty$ )

From the definition of order

$|f(x)| \le \; M |g(x)|\mbox{ for }x>x_0.$

Proof:

for all

x > 1

(we take

x 0 = 1

$|6x^4 - 2x^3 + 5| \le 6x^4 + 2x^3 + 5 \,$

$|6x^4 - 2x^3 + 5| \le 6x^4 + 2x^4 + 5x^4 \,$

$|6x^4 - 2x^3 + 5| \le 13x^4 \,$

$|6x^4 - 2x^3 + 5| \le 13 \,|x^4 |. \,$ where M = 13 in this example

Matters of notation

Equals sign

The statement " $f (x)$ is $O (g (x))$ " as defined above is usually written as $f (x) = O (g (x))$ . This is a slight abuse of notation; equality of two functions is not asserted, and it cannot be since the property of being $O (g (x))$ is not symmetric:

$O(x)=O(x^2)\mbox{ but }O(x^2)\ne O(x)$ .

There is also a second reason why that notation is not precise. The symbol f(x) means the value of the function f for the argument x. Hence the symbol of the function is f and not f(x).

For these reasons, some authors prefer set notation and write $f \in O(g)$ , thinking of $O (g)$ as the set of all functions dominated by g.

Other arithmetic operators

Big O notation can also be used in conjunction with other arithmetic operators in more complicated equations. For example, h(x) + O(f(x)) denotes the collection of functions having the growth of h(x) plus a part whose growth is limited to that of f(x). Thus,

$g(x) = h(x) + O(f(x))\,$

expresses the same as

$g(x) - h(x) \in O(f(x))\,.$

Example

Suppose an algorithm is being developed to operate on a set of n elements. Its developers are interested in finding a function T(n) that will express how long the algorithm will take to run (in some arbitrary measurement of time) in terms of the number of elements in the input set. The algorithm works by first calling a subroutine to operate on the elements in the set (e.g. sort them) and then doing its own operation on the set. The subroutine has a known time complexity of $O (n 2)$ , and after the subroutine runs the algorithm must take an additional $55 n 3 + 2 n + 10$ time before it terminates. Thus the overall time complexity of the algorithm can be expressed as

T (n) = O (n 2) + 55 n 3 + 2 n + 10

This can perhaps be most easily read by replacing $O (n 2)$ with "some function that grows asymptotically slower than $n 2$ ". Again, this usage disregards some of the formal meaning of the "=" and "+" symbols, but it does allow one to use the big O notation as a kind of convenient placeholder.

Declaration of variables

Another anomaly of the notation, although less exceptional, is that it does not make explicit which variable is the function argument, which may need to be inferred from the context if several variables are involved. The following two right-hand side big O notations have dramatically different meanings:

$f(m) = O(m^n)\,,$

$g(n)\,\, = O(m^n)\,.$

The first case states that f(m) exhibits polynomial growth, while the second, assuming m > 1, states that g(n) exhibits exponential growth. So as to avoid all possible confusion, some authors use the notation

$g \in O(f)\,,$

meaning the same as what is denoted by others as

$g(x) \in O(f(x))\,.$

Complex usages

In more complex usage, O( ) can appear in different places in an equation, even several times on each side. For example, the following are true for $n\to\infty$

(n + 1) 2 = n 2 + O (n)

$(n+O(n^{1/2}))(n + O(\log\,n))^2 = n^3 + O(n^{5/2})$

n O (1) = O (e n)

The meaning of such statements is as follows: for any functions which satisfy each O( ) on the left side, there are some functions satisfying each O( ) on the right side, such that substituting all these functions into the equation makes the two sides equal. For example, the third equation above means: "For any function f(n)=O(1), there is some function g(n)=O(eⁿ) such that n^f(n)=g(n)." In terms of the "set notation" above, the meaning is that the class of functions represented by the left side is a subset of the class of functions represented by the right side.

Orders of common functions

Here is a list of classes of functions that are commonly encountered when analyzing algorithms. All of these are as n increases to infinity. The slower-growing functions are listed first. c is an arbitrary constant.

Notation	Name	Example
$O\left(1\right)$	constant	Determining if a number is even or odd; using a constant-size lookup table or hash table
$O\left(\alpha(n)\right)$	inverse Ackermann	Amortized time per operation using a disjoint set
$O\left(\log^* n\right)$	iterated logarithmic	The `find` algorithm of Hopcroft and Ullman on a disjoint set
$O\left(\log \log n\right)$	double logarithmic	Amortized time per operation using a bounded priority queue^[2]
$O\left(\log n\right)$	logarithmic	Finding an item in a sorted array with a binary search
$O\left(\left(\log n\right)^c\right)$	polylogarithmic	Deciding if n is prime with the AKS primality test
$O\left({n^c}\right), 0<c<1$	fractional power	Searching in a kd-tree
$O\left(n\right)$	linear	Finding an item in an unsorted list; adding two n-digit numbers
$O\left(n\log n\right)$ = $O\left(\log n!\right)$	linearithmic, loglinear, or quasilinear	Performing a Fast Fourier transform; heapsort or merge sort
$O\left({n^2}\right)$	quadratic	Multiplying two n-digit numbers by a simple algorithm; adding two n×n matrices; bubble sort or insertion sort
$O\left({n^3}\right)$	cubic	Multiplying two n×n matrices by simple algorithm; finding the shortest path on a weighted digraph with the Floyd-Warshall algorithm
$O\left({n^c}\right)$	polynomial or algebraic	Tree-adjoining grammar parsing; maximum matching for bipartite graphs
$L n [α, c],0 < α < 1 =$ $e^{(c+o(1)) (\ln n)^\alpha (\ln \ln n)^{1-\alpha}}$	L-notation	Factoring a number using the special or general number field sieve
$O\left({c^n}\right)$	exponential or geometric	Finding the (exact) solution to the traveling salesman problem using dynamic programming; determining if two logical statements are equivalent using brute force
$O\left(n!\right)$ = $O\left({n^n}\right)$	factorial or combinatorial or "n to the n"	Solving the traveling salesman problem via brute-force search; finding the determinant with expansion by minors. The form $O\left({n^n}\right)$ is often used instead of $O\left(n!\right)$ to derive simpler formulas for asymptotic complexity.
$c_1^{O(c^n)}$	double exponential	Deciding the truth of a given statement in Presburger arithmetic

Not as common, but even larger growth is possible, such as the single-valued version of the Ackermann function, A(n,n).

For any k>0 and c>0, O(n^c(log n)^k) is subset of O(n^(c+a)) for any a>0. So O(n^c(log n)^k) may be considered as polynomial with some bigger order.

Properties

If a function f(n) can be written as a finite sum of other functions, then the fastest growing one determines the order of f(n). For example

$f(n) = 9 \log n + 5 (\log n)^3 + 3n^2 + 2n^3 \in O(n^3)\,\!.$

In particular, if a function may be bounded by a polynomial in n, then as n tends to infinity, one may disregard lower-order terms of the polynomial.

$O (n c)$ and $O (c n)$ are very different. The latter grows much, much faster, no matter how big the constant c is (as long as it is greater than one). A function that grows faster than any power of n is called superpolynomial. One that grows more slowly than any exponential function of the form $c n$ is called subexponential. An algorithm can require time that is both superpolynomial and subexponential; examples of this include the fastest known algorithms for integer factorization.

$O (log n)$ is exactly the same as $O (log(n c))$ . The logarithms differ only by a constant factor, (since $log(n c) = c log n$ ) and thus the big O notation ignores that. Similarly, logs with different constant bases are equivalent. Exponentials with different bases, on the other hand, are not of the same order. For example, $2 n$ and $3 n$ are not of the same order.

Changing units may or may not affect the order of the resulting algorithm. Changing units is equivalent to multiplying the appropriate variable by a constant wherever it appears. For example, if an algorithm runs in the order of n², replacing n by cn means the algorithm runs in the order of $c 2 n 2$ , and the big O notation ignores the constant $c 2$ . This can be written as $c^2n^2 \in O(n^2)$ . If, however, an algorithm runs in the order of $2 n$ , replacing n with cn gives $2 c n = (2 c) n$ . This is not equivalent to $2 n$ (unless, of course, c=1).

Changing of variable may affect the order of the resulting algorithm. For example, if an algorithm runs on the order of O(n) when n is the number of digits of the input number, then it has order O(log n) when n is the input number itself.

Product

$f_1 \in O(g_1)\ \wedge\ f_2\in O(g_2)\, \implies f_1 f_2\in O(g_1 g_2)\,$

$f\cdot O(g) \in O(f g)$

Sum

$f_1 \in O(g_1)\ \wedge\ f_2\in O(g_2)\, \implies f_1 + f_2\in O(g_1 + g_2)\,$

This implies $f_1 \in O(g) \land f_2 \in O(g) \implies f_1+f_2 \in O(g)$ , which means that

O (g)

is a convex cone.

If f and g are positive functions, $f + O(g) \in O(f + g)$

Multiplication by a constant

Let k be a constant. Then:

O (k g) = O (g)

$f\in O(g) \Rightarrow kf\in O(g)$

Related asymptotic notations

Big O is the most commonly used asymptotic notation for comparing functions, although in many cases Big O may be replaced with Big Theta Θ for asymptotically tighter bounds (Theta, see below). Here, we define some related notations in terms of Big O, progressing up to the family of Bachmann-Landau notations to which Big O notation belongs.

Little-o notation

The relation $f(x) \in o(g(x))$ is read as " $f (x)$ is little-o of $g (x)$ ". Intuitively, it means that $g (x)$ grows much faster than $f (x)$ . It assumes that f and g are both functions of one variable. Formally, it states that the limit of $f (x) / g (x)$ is zero, as x approaches infinity. For algebraically defined functions $f (x)$ and $g (x)$ , $\lim_{x \to \infty}f(x)/g(x)$ is generally found using L'Hôpital's rule.

For example,

$2x \in o(x^2) \,\!$
$2x^2 \not \in o(x^2)$
$1/x \in o(1)$

Little-o notation is common in mathematics but rarer in computer science. In computer science the variable (and function value) is most often a natural number. In math, the variable and function values are often real numbers. The following properties can be useful:

$o(f) + o(f) \subseteq o(f)$
$o(f)o(g) \subseteq o(fg)$
$o(o(f)) \subseteq o(f)$
$o(f) \subset O(f)$ (and thus the above properties apply with most combinations of o and O).

As with big O notation, the statement " $f (x)$ is $o (g (x))$ " is usually written as $f (x) = o (g (x))$ , which is a slight abuse of notation.

The family of Bachmann-Landau notations

Notation	Name	Intuition	As $n \to \infty$ , eventually...	Definition
$f(n) \in O(g(n))$	Big Omicron; Big O; Big Oh	$f$ is bounded above by $g$ (up to constant factor) asymptotically	$f(n) \leq g(n)\cdot k$	$\exists (k>0), n_0 : \forall(n>n_0) \; \|f(n)\| \leq \|g(n)\cdot k\|$ or $\exists (k>0), n_0 : \forall(n>n_0) \; f(n) \leq g(n)\cdot k$
$f(n) \in \Omega(g(n))$	Big Omega	$f$ is bounded below by $g$ (up to constant factor) asymptotically	$f(n) \geq g(n)\cdot k$	$\exists (k>0), n_0 : \forall (n>n_0) \; \|g(n)\cdot k\| \leq \|f(n)\|$
$f(n) \in \Theta(g(n))$	Big Theta	$f$ is bounded both above and below by $g$ asymptotically	$g(n)\cdot k_1 \leq f(n) \leq g(n)\cdot k_2$	$\exists (k_1,k_2>0), n_0 : \forall (n>n_0) \; \|g(n)\cdot k_1\| < \|f(n)\| < \|g(n)\cdot k_2\|$
$f(n) \in o(g(n))$	Small Omicron; Small O; Small Oh	$f$ is dominated by $g$ asymptotically	$f(n) < g(n)\cdot k$	$\forall (k>0),\exists n_0 : \forall(n>n_0) \; \|f(n)\| < \|g(n)\cdot k\|$
$f(n) \in \omega(g(n))$	Small Omega	$f$ dominates $g$ asymptotically	$f(n) > g(n)\cdot k$	$\forall (k>0),\exists n_0 : \forall(n>n_0) \; \|g(n)\cdot k\| < \|f(n)\|$
$f (n)$ ~ $g (n)$	on the order of	$f$ is equal to $g$ asymptotically	$f (n)$ ~ $g(n)\cdot k$	$\lim_{n \to \infty} \frac{f(n)}{g(n)} = k$

Bachmann-Landau notation was designed around several mnemonics, as shown in the As $n \to \infty$ , eventually... column above and in the bullets below. To conceptually access these mnemonics, "omicron" can be read "o-micron" and "omega" can be read "o-mega". Also, the lower-case versus capitalization of the Greek letters in Bachmann-Landau notation is mnemonic.

the o-micron mnemonic: The o-micron reading of $f(n) \in O(g(n))$ and of $f(n) \in o(g(n))$ can be thought of as "O-smaller than" and "o-smaller than", respectively. This micro/smaller mnemonic refers to: for sufficiently large input parameter(s), $f$ grows at a rate that may henceforth be less than $c g$ regarding $g \in O(f)$ or $g \in o(f)$ .
the o-mega mnemonic: The o-mega reading of $f(n) \in \Omega(g(n))$ and of $f(n) \in \omega(g(n))$ can be thought of as "O-larger than" and "o-larger than", respectively. This mega/larger mnemonic refers to: for sufficiently large input parameter(s), $f$ grows at a rate that may henceforth be greater than $c g$ regarding $g \in \Omega(f)$ or $g \in \omega(f)$ .
the upper-case mnemonic: This mnemonic reminds us when to use the upper-case Greek letters in $f(n) \in O(g(n))$ and $f(n) \in \Omega(g(n))$ : for sufficiently large input parameter(s), $f$ grows at a rate that may henceforth be equal to $c g$ regarding $g \in O(f)$ .
the lower-case mnemonic: This mnemonic reminds us when to use the lower-case Greek letters in $f(n) \in o(g(n))$ and $f(n) \in \omega(g(n))$ : for sufficiently large input parameter(s), $f$ grows at a rate that is henceforth inequal to $c g$ regarding $g \in O(f)$ .

Aside from Big O notation, the Big Theta Θ and Big Omega Ω notations are the two most often used in computer science; the Small Omega ω notation is rarely used in computer science.

Informally, especially in computer science, the Big O notation often is permitted to be somewhat abused to describe an asymptotic tight bound where using Big Theta Θ notation might be more factually appropriate in a given context. For example, when considering a function $T (n) = 73 n 3 + 22 n 2 + 58$ , all of the following are generally acceptable, but tightnesses of bound (i.e., bullets 2 and 3 below) are usually strongly preferred over laxness of bound (i.e., bullet 1 below).

$T (n) = O (n 100)$ , which is identical to $T(n) \in O(n^{100})$
$T (n) = O (n 3)$ , which is identical to $T(n) \in O(n^3)$
$T (n) = Θ(n 3)$ , which is identical to $T(n) \in \Theta (n^3)$

The equivalent English statements are respectively:

$T (n)$ grows asymptotically as fast or more slowly than $n 100$
$T (n)$ grows asymptotically as fast or more slowly than $n 3$
$T (n)$ grows asymptotically as fast as $n 3$

So while all three statements are true, progressively more information is contained in each. In some fields, however, the Big O notation (bullets number 2 in the lists above) would be used more commonly than the Big Theta notation (bullets number 3 in the lists above) because functions that grow more slowly are more desirable. For example, if $T (n)$ represents the running time of a newly developed algorithm for input size $n$ , the inventors and users of the algorithm might be more inclined to put an upper asymptotic bound on how long it will take to run without making an explicit statement about the lower asymptotic bound.

Extensions to the Bachmann-Landau notations

Another notation sometimes used in computer science is Õ (read soft-O). $f(n) = \tilde{O} (g(n))$ is shorthand for $f (n) = O (g (n)log k g (n))$ for some k. Essentially, it is Big O notation, ignoring logarithmic factors because the growth-rate effects of some other super-logarithmic function indicate a growth-rate explosion for large-sized input parameters that is more important to predicting bad run-time performance than the finer-point effects contributed by the logarithmic-growth factor(s). This notation is often used to obviate the "nitpicking" within growth-rates that are stated as too tightly bounded for the matters at hand (since $log k n$ is always $o (n ε)$ for any constant $k$ and any $ε > 0$ ).

The L notation, defined as

$L_n[\alpha,c]=O\left(e^{(c+o(1))(\ln n)^\alpha(\ln\ln n)^{1-\alpha}}\right)$ ,

is convenient for functions that are between polynomial and exponential.

Multiple variables

Big O (and little o, and Ω...) can also be used with multiple variables.

To define Big O formally for multiple variables, suppose $f(\vec{x})$ and $g(\vec{x})$ are two functions defined on some subset of $\mathbb{R}^n$ . We say

$f(\vec{x})\mbox{ is }O(g(\vec{x}))\mbox{ as }\vec{x}\to\infty$

if and only if

$\exists \;C,\exists \;M>0\mbox{ such that } |f(\vec{x})| \le \; M |g(\vec{x})|\mbox{ for all }\vec{x} \mbox{ with } x_i>C \mbox{ for all }i.$

For example, the statement

$f(n,m) = n^2 + m^3 + \hbox{O}(n+m) \mbox{ as } n,m\to\infty$

asserts that there exist constants C and M such that

$\forall n, m>M: |g(n,m)| \le C(n+m).$

where g(n,m) is defined by

$\displaystyle f(n,m) = n^2 + m^3 + g(n,m).$

Note that this definition allows all of the coordinates of $\vec{x}$ to increase to infinity. In particular, the statement

$f(n,m) = \hbox{O}(n^m) \mbox{ as } n,m\to\infty$

(i.e. $\exists C \exists M \forall n \forall m...$ ) is quite different from

$\forall m: f(n,m) = \hbox{O}(n^m) \mbox{ as } n\to\infty$

(i.e. $\forall m \exists C \exists M \forall n...$ ).

Graph theory

It is often useful to bound the running time of graph algorithms. Unlike most other computational problems, for a graph G = (V, E) there are two relevant parameters describing the size of the input: the number |V| of vertices in the graph and the number |E| of edges in the graph. Inside asymptotic notation (and only there), it is common to use the symbols V and E, when someone really means |V| and |E|. We adopt this convention here to simplify asymptotic functions and make them easily readable. The symbols V and E are never used inside asymptotic notation with their literal meaning, so this abuse of notation does not risk ambiguity. For example $O (E + V log V)$ means $O((E,V) \mapsto |E| + |V|\cdot\log|V|)$ for a suitable metric of graphs. Another common convention—referring to the values |V| and |E| by the names n and m, respectively—sidesteps this ambiguity.

Generalizations and related usages

The generalization to functions taking values in any normed vector space is straightforward (replacing absolute values by norms), where f and g need not take their values in the same space. A generalization to functions g taking values in any topological group is also possible.

The "limiting process" x→x_o can also be generalized by introducing an arbitrary filter base, i.e. to directed nets f and g.

The o notation can be used to define derivatives and differentiability in quite general spaces, and also (asymptotical) equivalence of functions,

$f\sim g \iff (f-g) \in o(g)$

which is an equivalence relation and a more restrictive notion than the relationship "f is Θ(g)" from above. (It reduces to $\lim f/g = 1$ if f and g are positive real valued functions.) For example, 2x is Θ(x), but 2x − x is not o(x).

References

^ Nicholas J. Higham, Handbook of writing for the mathematical sciences, SIAM. ISBN 0898714206, p. 25
^ Kurt Mehlhorn and Stefan Naher, "Bounded ordered dictionaries in O(log log N) time and O(n) space", Information Processing Letters (1990).

External links

Introduction to Asymptotic Notations

Retrieved from "http://en.wikipedia.org/wiki/Big_O_notation"

Hidden categories: Cleanup from April 2008 | All pages needing cleanup

This article is from Wikipedia. All text is available under the terms of the GNU Free Documentation License.

Big O notation

Contents

History

Formal definition

Usage

Infinite asymptotics

Infinitesimal asymptotics

Example

Matters of notation

Equals sign

Other arithmetic operators

Example

Declaration of variables

Complex usages

Orders of common functions

Properties

Product

Sum

Multiplication by a constant

Related asymptotic notations

Little-o notation

The family of Bachmann-Landau notations

Extensions to the Bachmann-Landau notations

Multiple variables

Graph theory

Generalizations and related usages

See also

References

Further reading

External links