Big-O, Θ, Ω Explanation Game

🎯 Asymptotic Notations

Big-O

Upper Bound
(At most)

Big-Theta

Tight Bound
(Exactly)

Big-Omega

Lower Bound
(At least)

📈 Bounding Graphs

O (Upper)

f(n) (Function)

Ω (Lower)

🎮 Quick Challenge

If f(n) = 2n² + 3n + 1, which is the tightest bound?

O(N³)

Θ(N²)

Ω(N)

These notations describe how a function grows relative to another function:

f(n) = O(g(n))

f grows at most as fast as g
(ceiling)

f(n) = Θ(g(n))

f grows exactly as fast as g
(tight bound)

f(n) = Ω(g(n))

f grows at least as fast as g
(floor)

⚙️ Configuration

Function f(n)

Show Bounds

Max N Value

N = 20

Big-O (Upper Bound)

Used in worst-case analysis. "The algorithm takes at most this many steps." Most common in interviews!

Big-Theta (Tight Bound)

The most precise bound. Function grows exactly at this rate. When O and Ω are the same!

Big-Omega (Lower Bound)

Used in best-case analysis. "The algorithm takes at least this many steps."