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, Edmund Landau, and others, collectively called Bachmann–Landau notation or asymptotic notation. 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. Big O notation is also used in many other fields to provide similar estimates.

Property Value
dbo:abstract
• 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, Edmund Landau, and others, collectively called Bachmann–Landau notation or asymptotic notation. 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. 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 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. Big O notation is also used in many other fields to provide similar estimates. (en)
dbo:thumbnail
dbo:wikiPageID
• 44578 (xsd:integer)
dbo:wikiPageLength
• 56367 (xsd:integer)
dbo:wikiPageRevisionID
• 983112441 (xsd:integer)
dbp:bot
• InternetArchiveBot (en)
dbp:date
• July 2020 (en)
dbp:fixAttempted
• yes (en)
dbp:project
• wikiversity (en)
dbp:text
• Wikiversity solved a MyOpenMath problem using Big-O Notation (en)
dbp:wikiPageUsesTemplate
dct:subject
rdfs:comment
• 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, Edmund Landau, and others, collectively called Bachmann–Landau notation or asymptotic notation. 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. Big O notation is also used in many other fields to provide similar estimates. (en)
rdfs:label
• Big O notation (en)
owl:sameAs
prov:wasDerivedFrom
foaf:depiction
foaf:isPrimaryTopicOf
is dbo:wikiPageDisambiguates of
is dbo:wikiPageRedirects of