Big O notation

Definition

Big O notation is a mathematical notation that describes the approximate size of a function on a domain. Big O is a member of a family of notations invented by German mathematicians Paul Bachmann and Edmund Landau and expanded by others, collectively called Bachmann–Landau notation. The letter O was chosen by Bachmann to stand for Ordnung, meaning the order of approximation.

Related concepts

0 Abuse of notation Acta Mathematica Aleksandar Ivić An Introduction to the Theory of Numbers Analysis of algorithms Analytic number theory Andrew Wiles Approximation Arithmetic function Asymptotic analysis Asymptotic computational complexity Asymptotic expansion Asymptotically optimal algorithm Bell number Big O in probability notation Binary search algorithm Binomial heap Binomial series Bipartite graph Bounded function Brute-force search Bubble sort Calculus Cambridge University Press Charles E. Leiserson Clifford Stein Comparison sort Complex analysis Complex analytic Complex number Computational Geometry (journal)Computational complexity of mathematical operations Computational complexity theory Computer science Constant time Curve fitting Derivative Determinant Differentiability Disjoint-set data structure Domain of a function Donald Knuth Dynamic programming E. M. Wright Edmund Landau Element (mathematics)Equality relation Equivalence relation Eventually (mathematics)Exponential function Exponential time Factorial False precision Fast Fourier transform Filter base Function (mathematics)Function argument G. H. Hardy General number field sieve Generalization error Godfrey Harold Hardy Heapsort Henryk Iwaniec Insertion sort Integer factorization Integral transform Interpolation search Introduction to Algorithms Inverse Ackermann function Ivan Matveyevich Vinogradov John Edensor Littlewood Joseph H. Silverman K-d tree L'Hôpital's rule L-notation LU decomposition Laplace expansion Limit (mathematics)Limit inferior and limit superior Limit of a function Linear time Linearithmic time List of logic symbols Log-star Logarithmic time Lookup table Master theorem (analysis of algorithms)Matching (graph theory)Mathematical analysis Mathematical notation Merge sort Michael Sipser Multiplication algorithm N. G. de Bruijn Nachbin's theorem Natural logarithm Net (mathematics)Nicolaas Govert de Bruijn Normed vector space Notices of the American Mathematical Society Omar Vizquel Omega Omicron One-sided limit Order of accuracy Order of approximation Oren Patashnik Parallel random-access machine Partially ordered set Paul Bachmann Paul Gustav Heinrich Bachmann Paul du Bois-Reymond Polygon triangulation Polylogarithmic function Polylogarithmic time Polynomial time Power series Prime number theorem Proj construction Quadratic sieve Quadratic time Quicksort Raimund Seidel Real number Riemann zeta function Ripple carry adder Roger Heath-Brown Ronald Graham Ronald L. Rivest SIAM Journal on Computing SIGACT News Scale analysis (mathematics)Scientific modelling Selection sort Set (mathematics)Set notation Shellsort Significant figures Stirling's formula Sub-exponential time Taylor's theorem Taylor series TeX Thomas H. Cormen Time complexity Topological group Transitive relation Travelling salesman problem Tree-adjoining grammar Tree data structure Tree sort Trial division Upper and lower bounds Upper bound

8 concepts already in your glossary