Fit approximation |
---|
Concepts |
Orders of approximation Scale analysis · Big O notation Curve fitting · False precision Significant figures |
Other fundamentals |
Approximation · Generalization error Taylor polynomial Scientific modelling |
Big O notation is a mathematical notation that describes the limiting behavior of a function when the argument tends towards a particular value or infinity. Big O is a member of a family of notations invented by Paul Bachmann,^{[1]} Edmund Landau,^{[2]} and others, collectively called Bachmann–Landau notation or asymptotic notation. The letter O was chosen by Bachmann to stand for Ordnung, meaning the order of approximation.
In computer science, big O notation is used to classify algorithms according to how their run time or space requirements grow as the input size grows.^{[3]} In analytic number theory, big O notation is often used to express a bound on the difference between an arithmetical function and a better understood approximation; a famous example of such a difference is the remainder term in the prime number theorem. Big O notation is also used in many other fields to provide similar estimates.
Big O notation characterizes functions according to their growth rates: different functions with the same growth rate may be represented using the same O notation. The letter O is used because the growth rate of a function is also referred to as the order of the function. 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.
Let , the function to be estimated, be a real or complex valued function and let , the comparison function, be a real valued function. Let both functions be defined on some unbounded subset of the positive real numbers, and be strictly positive for all large enough values of .^{[4]} One writes
In many contexts, the assumption that we are interested in the growth rate as the variable goes to infinity is left unstated, and one writes more simply that
The notation can also be used to describe the behavior of near some real number (often, ): we say
As is chosen to be strictly positive for such values of , both of these definitions can be unified using the limit superior:
And in both of these definitions the limit point (whether or not) is a cluster point of the domains of and , i. e., in every neighbourhood of there have to be infinitely many points in common. Moreover, as pointed out in the article about the limit inferior and limit superior, the (at least on the extended real number line) always exists.
In computer science, a slightly more restrictive definition is common: and are both required to be functions from some unbounded subset of the positive integers to the nonnegative real numbers; then iff there exist positive integer numbers and such that for all .^{[5]}
In typical usage the O notation is asymptotical, that is, it refers to very large x. In this setting, the contribution of the terms that grow "most quickly" will eventually make the other ones irrelevant. As a result, the following simplification rules can be applied:
For example, let f(x) = 6x^{4} − 2x^{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^{4}, −2x^{3}, 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^{4}. Now one may apply the second rule: 6x^{4} is a product of 6 and x^{4} in which the first factor does not depend on x. Omitting this factor results in the simplified form x^{4}. Thus, we say that f(x) is a "big O" of x^{4}. Mathematically, we can write f(x) = O(x^{4}). One may confirm this calculation using the formal definition: let f(x) = 6x^{4} − 2x^{3} + 5 and g(x) = x^{4}. Applying the formal definition from above, the statement that f(x) = O(x^{4}) is equivalent to its expansion,
Big O notation has two main areas of application:
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:^{[citation needed]}
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.^{[original research?]}
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^{2} − 2n + 2. As n grows large, the n^{2} term will come to dominate, so that all other terms can be neglected—for instance when n = 500, the term 4n^{2} 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^{3} or n^{4}. Even if T(n) = 1,000,000n^{2}, if U(n) = n^{3}, the latter will always exceed the former once n grows larger than 1,000,000 (T(1,000,000) = 1,000,000^{3} = 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
or
and say that the algorithm has order of n^{2} time complexity. The sign "=" is not meant to express "is equal to" in its normal mathematical sense, but rather a more colloquial "is", so the second expression is sometimes considered more accurate (see the "Equals sign" discussion below) while the first is considered by some as an abuse of notation.^{[6]}
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. Consider, for example, the exponential series and two expressions of it that are valid when x is small:
The second expression (the one with O(x^{3})) means the absolute-value of the error e^{x} − (1 + x + x^{2}/2) is at most some constant times |x^{3}| when x is close enough to 0.
If the function f can be written as a finite sum of other functions, then the fastest growing one determines the order of f(n). For example,
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. The sets O(n^{c}) and O(c^{n}) are very different. If c is greater than one, then the latter grows much faster. A function that grows faster than n^{c} for any c 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 and the function n^{log n}.
We may ignore any powers of n inside of the logarithms. The set 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. On the other hand, exponentials with different bases 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^{2}, 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^{2}n^{2} = 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 variables may also affect the order of the resulting algorithm. For example, if an algorithm's run time is O(n) when measured in terms of the number n of digits of an input number x, then its run time is O(log x) when measured as a function of the input number x itself, because n = O(log x).
If and then . It follows that if and then . In other words, this second statement says that is a convex cone.
Let k be a nonzero constant. Then . In other words, if , then
Big O (and little o, Ω, etc.) can also be used with multiple variables. To define big O formally for multiple variables, suppose and are two functions defined on some subset of . We say
if and only if there exist constants and such that for all with for some ^{[7]} Equivalently, the condition that for some can be written , where denotes the Chebyshev norm. For example, the statement
asserts that there exist constants C and M such that
whenever either or holds. This definition allows all of the coordinates of to increase to infinity. In particular, the statement
(i.e., ) is quite different from
(i.e., ).
Under this definition, the subset on which a function is defined is significant when generalizing statements from the univariate setting to the multivariate setting. For example, if and , then if we restrict and to , but not if they are defined on .
This is not the only generalization of big O to multivariate functions, and in practice, there is some inconsistency in the choice of definition.^{[8]}
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 de Bruijn says, O(x) = O(x^{2}) is true but O(x^{2}) = O(x) is not.^{[9]} Knuth describes such statements as "one-way equalities", since if the sides could be reversed, "we could deduce ridiculous things like n = n^{2} from the identities n = O(n^{2}) and n^{2} = O(n^{2})."^{[10]} In another letter, Knuth also pointed out that "the equality sign is not symmetric with respect to such notations", as, in this notation, "mathematicians customarily use the = sign as they use the word "is" in English: Aristotle is a man, but a man isn't necessarily Aristotle".^{[11]}
For these reasons, it would be more precise to use set notation and write f(x) ∈ O(g(x)) (read as: "f(x) is an element of O(g(x))", or "f(x) is in the set O(g(x))"), thinking of O(g(x)) as the class of all functions h(x) such that |h(x)| ≤ C|g(x)| for some constant C.^{[10]} However, the use of the equals sign is customary.^{[9]}^{[10]}
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,
expresses the same as
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 55n^{3} + 2n + 10 steps before it terminates. Thus the overall time complexity of the algorithm can be expressed as T(n) = 55n^{3} + O(n^{2}). Here the terms 2n + 10 are subsumed within the faster-growing O(n^{2}). Again, this usage disregards some of the formal meaning of the "=" symbol, but it does allow one to use the big O notation as a kind of convenient placeholder.
In more complicated usage, O(·) can appear in different places in an equation, even several times on each side. For example, the following are true for :
Big O is typeset as an italicized uppercase "O", as in the following example: .^{[12]}^{[13]} In TeX, it is produced by simply typing O inside math mode. Unlike Greek-named Bachmann–Landau notations, it needs no special symbol. Yet, some authors use the calligraphic variant instead.^{[14]}^{[15]}
Further information: Time complexity § Table of common time complexities |
Here is a list of classes of functions that are commonly encountered when analyzing the running time of an algorithm. In each case, c is a positive constant and n increases without bound. The slower-growing functions are generally listed first.
Notation | Name | Example |
---|---|---|
constant | Determining if a binary number is even or odd; Calculating ; Using a constant-size lookup table | |
double logarithmic | Average number of comparisons spent finding an item using interpolation search in a sorted array of uniformly distributed values | |
logarithmic | Finding an item in a sorted array with a binary search or a balanced search tree as well as all operations in a binomial heap | |
polylogarithmic | Matrix chain ordering can be solved in polylogarithmic time on a parallel random-access machine. | |
fractional power | Searching in a k-d tree | |
linear | Finding an item in an unsorted list or in an unsorted array; adding two n-bit integers by ripple carry | |
n log-star n | Performing triangulation of a simple polygon using Seidel's algorithm, or the union–find algorithm. Note that | |
linearithmic, loglinear, quasilinear, or "n log n" | Performing a fast Fourier transform; fastest possible comparison sort; heapsort and merge sort | |
quadratic | Multiplying two n-digit numbers by schoolbook multiplication; simple sorting algorithms, such as bubble sort, selection sort and insertion sort; (worst-case) bound on some usually faster sorting algorithms such as quicksort, Shellsort, and tree sort | |
polynomial or algebraic | Tree-adjoining grammar parsing; maximum matching for bipartite graphs; finding the determinant with LU decomposition | |
L-notation or sub-exponential | Factoring a number using the quadratic sieve or number field sieve | |
exponential | Finding the (exact) solution to the travelling salesman problem using dynamic programming; determining if two logical statements are equivalent using brute-force search | |
factorial | Solving the travelling salesman problem via brute-force search; generating all unrestricted permutations of a poset; finding the determinant with Laplace expansion; enumerating all partitions of a set |
The statement is sometimes weakened to to derive simpler formulas for asymptotic complexity. For any and , is a subset of for any , so may be considered as a polynomial with some bigger order.
Big O is widely used in computer science. Together with some other related notations it forms the family of Bachmann–Landau notations.^{[citation needed]}
"Little o" redirects here. For the baseball player, see Omar Vizquel. |
Intuitively, the assertion "f(x) is o(g(x))" (read "f(x) is little-o of g(x)") means that g(x) grows much faster than f(x). Let as before f be a real or complex valued function and g a real valued function, both defined on some unbounded subset of the positive real numbers, such that g(x) is strictly positive for all large enough values of x. One writes
if for every positive constant ε there exists a constant such that
For example, one has
The difference between the definition of the big-O notation and the definition of little-o is that while the former has to be true for at least one constant M, the latter must hold for every positive constant ε, however small.^{[17]} In this way, little-o notation makes a stronger statement than the corresponding big-O notation: every function that is little-o of g is also big-O of g, but not every function that is big-O of g is also little-o of g. For example, but .
As g(x) is nonzero, or at least becomes nonzero beyond a certain point, the relation is equivalent to
Little-o respects a number of arithmetic operations. For example,
It also satisfies a transitivity relation:
Another asymptotic notation is , read "big omega".^{[18]} There are two widespread and incompatible definitions of the statement
where a is some real number, ∞, or −∞, where f and g are real functions defined in a neighbourhood of a, and where g is positive in this neighbourhood.
The Hardy–Littlewood definition is used mainly in analytic number theory, and the Knuth definition mainly in computational complexity theory; the definitions are not equivalent.
In 1914 Godfrey Harold Hardy and John Edensor Littlewood introduced the new symbol ,^{[19]} which is defined as follows:
Thus is the negation of .
In 1916 the same authors introduced the two new symbols and , defined as:^{[20]}
These symbols were used by Edmund Landau, with the same meanings, in 1924.^{[21]} After Landau, the notations were never used again exactly thus; became and became .^{[citation needed]}
These three symbols , as well as (meaning that and are both satisfied), are now currently used in analytic number theory.^{[22]}^{[23]}
We have
and more precisely
We have
and more precisely
however
In 1976 Donald Knuth published a paper to justify his use of the -symbol to describe a stronger property.^{[24]} Knuth wrote: "For all the applications I have seen so far in computer science, a stronger requirement ... is much more appropriate". He defined
with the comment: "Although I have changed Hardy and Littlewood's definition of , I feel justified in doing so because their definition is by no means in wide use, and because there are other ways to say what they want to say in the comparatively rare cases when their definition applies."^{[24]}
Notation | Name^{[24]} | Description | Formal definition | Limit definition^{[25]}^{[26]}^{[27]}^{[24]}^{[19]} |
---|---|---|---|---|
Small O; Small Oh | f is dominated by g asymptotically | |||
Big O; Big Oh; Big Omicron | is bounded above by g (up to constant factor) asymptotically | |||
Big Theta | f is bounded both above and below by g asymptotically | and (Knuth version) | ||
On the order of | f is equal to g asymptotically | |||
Big Omega in complexity theory (Knuth) | f is bounded below by g asymptotically | |||
Small Omega | f dominates g asymptotically | |||
Big Omega in number theory (Hardy–Littlewood) | is not dominated by g asymptotically |
The limit definitions assume for sufficiently large . The table is (partly) sorted from smallest to largest, in the sense that (Knuth's version of) on functions correspond to on the real line^{[27]} (the Hardy–Littlewood version of , however, doesn't correspond to any such description).
Computer science uses the big , big Theta , little , little omega and Knuth's big Omega notations.^{[28]} Analytic number theory often uses the big , small , Hardy–Littlewood's big Omega (with or without the +, − or ± subscripts) and notations.^{[22]} The small omega notation is not used as often in analysis.^{[29]}
Further information: Analysis of algorithms |
Informally, especially in computer science, the big O notation often can be used somewhat differently to describe an asymptotic tight bound where using big Theta Θ notation might be more factually appropriate in a given context.^{[citation needed]} For example, when considering a function T(n) = 73n^{3} + 22n^{2} + 58, all of the following are generally acceptable, but tighter bounds (such as numbers 2 and 3 below) are usually strongly preferred over looser bounds (such as number 1 below).
The equivalent English statements are respectively:
So while all three statements are true, progressively more information is contained in each. In some fields, however, the big O notation (number 2 in the lists above) would be used more commonly than the big Theta notation (items numbered 3 in the lists above). 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.
In their book Introduction to Algorithms, Cormen, Leiserson, Rivest and Stein consider the set of functions f which satisfy
In a correct notation this set can, for instance, be called O(g), where
The authors state that the use of equality operator (=) to denote set membership rather than the set membership operator (∈) is an abuse of notation, but that doing so has advantages.^{[6]} Inside an equation or inequality, the use of asymptotic notation stands for an anonymous function in the set O(g), which eliminates lower-order terms, and helps to reduce inessential clutter in equations, for example:^{[31]}
Another notation sometimes used in computer science is Õ (read soft-O): f(n) = Õ(g(n)) is shorthand for f(n) = O(g(n) log^{k} n) for some k.^{[32]} Some authors write O^{*} for the same purpose.^{[33]} 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).
Also the L notation, defined as
is convenient for functions that are between polynomial and exponential in terms of .
The symbol O was first introduced by number theorist Paul Bachmann in 1894, in the second volume of his book Analytische Zahlentheorie ("analytic number theory").^{[1]} The number theorist Edmund Landau adopted it, and was thus inspired to introduce in 1909 the notation o;^{[2]} hence both are now called Landau symbols. These notations were used in applied mathematics during the 1950s for asymptotic analysis.^{[34]} The symbol (in the sense "is not an o of") was introduced in 1914 by Hardy and Littlewood.^{[19]} Hardy and Littlewood also introduced in 1916 the symbols ("right") and ("left"),^{[20]} precursors of the modern symbols ("is not smaller than a small o of") and ("is not larger than a small o of"). Thus the Omega symbols (with their original meanings) are sometimes also referred to as "Landau symbols". This notation became commonly used in number theory at least since the 1950s.^{[35]} In the 1970s the big O was popularized in computer science by Donald Knuth, who introduced the related Theta notation, and proposed a different definition for the Omega notation.^{[24]}
Landau never used the big Theta and small omega symbols.
Hardy's symbols were (in terms of the modern O notation)
(Hardy however never defined or used the notation , nor , as it has been sometimes reported). Hardy introduced the symbols and (as well as some other symbols) in his 1910 tract "Orders of Infinity", and made use of them only in three papers (1910–1913). In his nearly 400 remaining papers and books he consistently used the Landau symbols O and o.
Hardy's notation is not used anymore. On the other hand, in the 1930s,^{[36]} the Russian number theorist Ivan Matveyevich Vinogradov introduced his notation , which has been increasingly used in number theory instead of the notation. We have
and frequently both notations are used in the same paper.
The big-O originally stands for "order of" ("Ordnung", Bachmann 1894), and is thus a Latin letter. Neither Bachmann nor Landau ever call it "Omicron". The symbol was much later on (1976) viewed by Knuth as a capital omicron,^{[24]} probably in reference to his definition of the symbol Omega. The digit zero should not be used.