WOLFRAM NOTEBOOK

WOLFRAM|DEMONSTRATIONS PROJECT

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.
Wolfram Cloud

You are using a browser not supported by the Wolfram Cloud

Supported browsers include recent versions of Chrome, Edge, Firefox and Safari.


I understand and wish to continue anyway »

You are using a browser not supported by the Wolfram Cloud. Supported browsers include recent versions of Chrome, Edge, Firefox and Safari.