Algorithm Complexity -3

BIG O NOTATION
In mathematics, computer science, and related fields, big O notation (also known as Big Oh notation, Landau notation, Bachmann–Landau notation, and asymptotic notation) describes the limiting behavior of a function when the argument tends towards a particular value or infinity, usually in terms of simpler functions. Big O notation allows its users to simplify functions in order to concentrate on their growth rates: different functions with the same growth rate may be represented using the same O notation.

Although developed as a part of pure mathematics, this notation is now frequently also used in the analysis of algorithms to describe an algorithm's usage of computational resources: the worst case or average case running time or memory usage of an algorithm is often expressed as a function of the length of its input using big O notation. This allows algorithm designers to predict the behavior of their algorithms and to determine which of multiple algorithms to use, in a way that is independent of computer architecture or clock rate. Because Big O notation discards multiplicative constants on the running time, and ignores efficiency for low input sizes, it does not always reveal the fastest algorithm in practice or for practically-sized data sets. But the approach is still very effective for comparing the scalability of various algorithms as input sizes become large.

A description of a function in terms of big O notation usually only provides an upper bound on the growth rate of the function. Associated with big O notation are several related notations, using the symbols o, Ω, ω, and Θ, to describe other kinds of bounds on asymptotic growth rates. Big O notation is also used in many other fields to provide similar estimates.

Formal definition

Let f(x) and g(x) be two functions defined on some subset of the real numbers. One writes

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

if and only if, for sufficiently large values of x, f(x) is at most a constant multiplied by g(x) in absolute value. That is, f(x) = O(g(x)) if and only if there exists a positive real number M and a real number x₀ such that

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

In many contexts, the assumption that we are interested in the growth rate as the variable x goes to infinity is left unstated, and one writes more simply that f(x) = O(g(x)).
The notation can also be used to describe the behavior of f near some real number a (often, a = 0): 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.$

Example

In typical usage, the formal definition of O notation is not used directly; rather, the O notation for a function f(x) is derived by the following simplification rules:

If f(x) is a sum of several terms, the one with the largest growth rate is kept, and all others omitted.
If f(x) is a product of several factors, any constants (terms in the product that do not depend on x) are omitted.

For example, let

f (x) = 6 x 4 - 2 x 3 + 5

, and suppose we wish to simplify this function, using O notation, to describe its growth rate as x approaches infinity. This function is the sum of three terms: 6x⁴, −2x³, and 5. Of these three terms, the one with the highest growth rate is the one with the largest exponent as a function of x, namely 6x⁴. Now one may apply the second rule: 6x⁴ is a product of 6 and x⁴ in which the first factor does not depend on x. Omitting this factor results in the simplified form x⁴. Thus, we say that f(x) is a big-oh of (x⁴) or mathematically we can write f(x) = O(x⁴).
One may confirm this calculation using the formal definition: let f(x) = 6x⁴ − 2x³ + 5 and g(x) = x⁴. Applying the formal definition from above, the statement that f(x) = O(x⁴) is equivalent to its expansion,

$|f(x)| \le \; M |g(x)|$

for some suitable choice of x₀ and M and for all x > x₀. To prove this, let x₀ = 1 and M = 13. Then, for all x > x₀:

$\begin{align}|6x^4 - 2x^3 + 5| &\le 6x^4 + |2x^3| + 5\\ &\le 6x^4 + 2x^4 + 5x^4\\ &= 13x^4,\\ &= 13|x^4|\end{align}$

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

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 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 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)$

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 is technically accurate (see the "Equals sign" discussion below) while the first is a common abuse of notation.

Infinitesimal asymptotics

Big O can also be used to describe the error term in an approximation to a mathematical function. The most significant terms are written explicitly, and then the least-significant terms are summarized in a single big O term. 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 - (1 + x + x^2/2)$ , is smaller in absolute value than some constant times

| x 3 |

when

x

is close enough to

0

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 cn = (2 c) n

. This is not equivalent to

2 n

in general.
Changing of variable may affect the order of the resulting algorithm. For example, if an algorithm's running time is O(n) when measured in terms of the number n of digits of an input number x, then its running time is O(log x) when measured as a function of the input number x itself, because n = Θ(log x).

Product

$f_1 \in O(g_1) \text{ and } f_2\in O(g_2)\, \Rightarrow 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) \text{ and } f_2\in O(g_2)\, \Rightarrow f_1 + f_2\in O(|g_1| + |g_2|)\,$

This implies $f_1 \in O(g) \text{ and } f_2 \in O(g) \Rightarrow 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)$ if k is nonzero.

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

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 C |g(\vec{x})|\mbox{ for all }\vec{x} \mbox{ with } x_i>M \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\colon |g(n,m)| \le C(n+m),$

where g(n,m) is defined by

$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\dots$ ) is quite different from

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

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

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)). Some consider this to be an abuse of notation, since the use of the equals sign could be misleading as it suggests a symmetry that this statement does not have. As it is said, O(x) = O(x²) is true but O(x²) = O(x) is not.Knuth describes such statements as "one-way equalities", since if the sides could be reversed, "we could deduce ridiculous things like n = n² from the identities n = O(n²) and n² = O(n²)."
For these reasons, it would be more precise to use set notation and write f(x) ∈ O(g(x)), thinking of O(g(x)) as the class of all functions h(x) such that |h(x)| ≤ C|g(n)| for some constant C. However, the use of the equals sign is customary. Knuth pointed out that "mathematicians customarily use the = sign as they use the word 'is' in English: Aristotle is a man, but a man isn’t necessarily Aristotle."

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 sort the elements in the set and then perform its own operations. The sort 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)+55n^3+2n+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 feature of the notation, although less exceptional, is that function arguments may need to be inferred from the context when 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. To avoid confusion, some authors use the notation

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

rather than the less explicit

$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 n)

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.

Algorithm Complexity -3

Formal definition

Example