Big O notation: Difference between revisions
Jump to navigation
Jump to search
imported>Matt Mahlmann m (added wikilinks) |
imported>Aleksander Stos (link to original article) |
||
| Line 1: | Line 1: | ||
The '''big O notation''' is a mathematical notation to express various bounds concerning asymptotic behaviour of functions. It is often used in particular applications in [[physics]], [[computer science]], [[engineering]] and other [[applied sciences]]. | The '''big O notation''' is a mathematical notation to express various bounds concerning asymptotic behaviour of functions. It is often used in particular applications in [[physics]], [[computer science]], [[engineering]] and other [[applied sciences]]. For example, a typical context use in computer science is to express the [[complexity of algorithms]]. | ||
[[Category:Mathematics Workgroup]] | [[Category:Mathematics Workgroup]] | ||
[[Category: CZ Live]] | [[Category: CZ Live]] | ||
Revision as of 03:36, 26 April 2007
The big O notation is a mathematical notation to express various bounds concerning asymptotic behaviour of functions. It is often used in particular applications in physics, computer science, engineering and other applied sciences. For example, a typical context use in computer science is to express the complexity of algorithms.