Editing Big O notation (section)

== See also ==
* [[Asymptotic computational complexity]]
* [[Asymptotic expansion]]: Approximation of functions generalizing Taylor's formula
* [[Asymptotically optimal algorithm]]: A phrase frequently used to describe an algorithm that has an upper bound asymptotically within a constant of a lower bound for the problem
* [[Big O in probability notation]]: ''O<sub>p</sub>'', ''o<sub>p</sub>''
* [[Limit inferior and limit superior]]: An explanation of some of the limit notation used in this article
* [[Master theorem (analysis of algorithms)]]: For analyzing divide-and-conquer recursive algorithms using big O notation
* [[Nachbin's theorem]]: A precise method of bounding [[complex analytic]] functions so that the domain of convergence of [[integral transform]]s can be stated
* [[Order of approximation]]
* [[Order of accuracy]]
* [[Computational complexity of mathematical operations]]