Big-O complexity explorer

easy

Plot every complexity class on one chart and step the input size up. The point is not the formulas - it is the moment O(2ⁿ) leaves the screen and O(n²) starts costing hours.

Loading the big-o complexity explorer engine…

Where to go next

Arrays and memory layout

easy

Why indexing is O(1) and inserting at the front is not.

Recursion and the call stack

easy

Watch fib(n) build an exponential tree, then memoise it away.

Bubble sort

easy

Repeatedly swap neighbours until nothing moves.