Skip to main content
/
Concepts
/
Big O Notation
1 / 13
Speed
EN
ES
1.1
0.9
0.7
0.4
0.2
0.0
0
1
2
3
4
5
6
7
8
9
10
n (input size)
operations
O(1)
O(log n)
O(n)
O(n log n)
O(n²)
Step 1:
Big O measures how an algorithm scales. Watch each curve grow as the input size (n) increases.