##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
(Ranked by speed)
From fastest to slowest: O(1) < O(log n) < O(n) < O(n log n) < O(n²) < O(2^n) < O(n!).
Each jump is significant. The difference between O(n) and O(n²) can mean milliseconds versus minutes for large inputs.
When you see a complexity class, you instantly know the scalability ceiling.
