Robert Zieliński / Simulators / Computer Science / Algorithms

10 time-complexity patterns all ten running at once · every operation counted · pure JS

unison cycle 0% Σ ops 0 / 0 n = 16

all ten at once unison log curves n speed t = 0.000 s

O(n)

Pattern · Hash Lookup idle

waiting for simulator…

Pattern the code · Visualization the work, live · Growth the curve · Big-O the class, the count, and the n that still fits in 1 s O(1) O(log n) O(n) · O(n+m) O(n log n) O(n²) O(2ⁿ) O(n!)