Big O Notation ·
Time Complexity
un
seel
.com · algorithm efficiency · growth rates · asymptotic analysis
Input Size
0
Growth
—
Complexity
—
O(1) — Constant
O(log n) — Logarithmic
O(n) — Linear
O(n log n) — Linearithmic
O(n²) — Quadratic
O(2ⁿ) — Exponential
▶ Play
←
→
🔇 Unmute
Reset
Un
seel
.com · Big O Notation