Algorithmic Complexity and Big-O Notation

​
n
15
plot
list plot
list line plot
list log plot
fill
none
axis
range
Automatic
All
Ο(1)
Ο(n)
Ο(log(n))
Ο(
2
n
)
Ο(
n
2
)
Ο(n!)
In computer science and mathematics, big-O notation is used to describe algorithmic complexity, a measure of the computational cost required to process data and return a result.

External Links

Big-O Notation (Wolfram MathWorld)

Permanent Citation

Daniel de Souza Carvalho
​
​"Algorithmic Complexity and Big-O Notation"​
​http://demonstrations.wolfram.com/AlgorithmicComplexityAndBigONotation/​
​Wolfram Demonstrations Project​
​Published: January 1, 1999