O(zero)
Algorithmic complexity — everyone’s favorite concept for geeking out and squeezing out performance.
You have a problem to solve. You come up with a solution and it’s O(n^2). You see that it won’t work and need to make it better. You tweak it a bit and get to linear complexity — O(n). You’re happy because things are looking brighter.