📈 Big-O Complexity Visualizer

Toggle classes, drag n, and watch how the operation count grows.

Input size n = 16

Classes · ops at n = 16

Tap a class to show/hide it. Flatter = scales better.

🧩 Which grows faster? · score 0 · streak 0

This is the "watch the cost fall" chart behind every algorithm lab — Two Pointers went O(n²)→O(n), a heap gives O(log n), and pruning tames O(nⁿ) search.

Big-O Complexity Visualizer: Compare O(1) to O(n!) on One Chart

This Big-O visualizer is the capstone for the algorithm labs: it plots how the number of operations grows with input size n for every common complexity class — O(1), O(log n), O(n), O(n log n), O(n²), O(n³), O(2ⁿ), and O(n!) — on a shared log scale so the near-flat and the explosive curves fit on one chart. Drag the n slider and watch the gaps between classes widen dramatically; toggle any class on or off and read its exact operation count at the current n in the legend, formatted right up to astronomically large values. A predict game asks which of two classes needs more operations at the chosen n, building real intuition for growth rates. It's the same 'watch the cost fall' idea shown across the DSA labs, unified in one place — Two Pointers going O(n²) to O(n), a heap's O(log n), Dijkstra's O((V+E) log V), and why pruning tames exponential search.

What you can do in this simulation

Plot O(1) through O(n!) on one log-scale chart and compare how steeply each class rises
Drag the input-size slider n and watch the operation-count gap between classes explode at scale
Toggle any complexity class on or off; the legend shows its exact op count at the current n
Predict game: guess which of two classes needs more operations at a given n, with a score and streak
Presets for the fast classes, the polynomials, and the intractable ones (2ⁿ and n!) — and see why n = 50 factorial is hopeless

Concepts covered

big o notation · time complexity · algorithm analysis · growth rates · logarithmic vs exponential · tractable vs intractable · asymptotic analysis

Related simulations

Browse all Technology simulations →

Free to use in your browser — no signup required. Found a bug or have an idea to make it better? Tell us.

Please wait

Loading technology simulations

The requested content is still loading.

Finished experimenting?

Save one completion to this browser's signed guest ledger, or directly to your account when signed in.

Big-O Complexity Visualizer: Compare O(1) to O(n!) on One Chart

What you can do in this simulation

Plot O(1) through O(n!) on one log-scale chart and compare how steeply each class rises

Drag the input-size slider n and watch the operation-count gap between classes explode at scale

Toggle any complexity class on or off; the legend shows its exact op count at the current n

Predict game: guess which of two classes needs more operations at a given n, with a score and streak

Presets for the fast classes, the polynomials, and the intractable ones (2ⁿ and n!) — and see why n = 50 factorial is hopeless