← all demos
Computer & Data Science

Big-O Growth Rates

T(n) ∈ {n, n log₂n, n²}
Big-O Growth Rates

The three canonical complexity classes diverging as input size grows: linear and linearithmic stay close while the quadratic curve races away, dwarfing them by n=20.

Computed & rendered in pure C# on the frozen OnlyCSharp 1.8 library — animation baked to GIF with the library's own Gif encoder (no GPU, no ffmpeg, no external packages).