Playground

Big O Racer

Race runners representing O(1), O(log N), O(N), O(N²), and O(2ᴺ) across a visual track to feel the difference time complexity makes.

Algorithm Playground

Big O Racer

Pick an input size, launch the race, and compare how fast each complexity class reaches the finish.

Ready | n = 100

Setup

Log scale input

Race

Faster growth reaches later

O(1)Constant
O(log N)Logarithmic
O(N)Linear
O(N^2)Quadratic
O(2^N)Exponential

Operation Estimate

At current N

O(1)

1

O(log N)

7

O(N)

100

O(N^2)

10.0K

O(2^N)

1.3e30

Growth Curve

N from 1 to 12