Big-O describes how the work grows as the input gets bigger. The gap between classes is the whole game: at n = 50, an O(log n) algorithm does about 6 steps while O(2ⁿ) does a quadrillion. Move the slider to see it.
newsletter
What's actually being asked right now
Interview patterns & comp trends, straight to your inbox.
No spam. Unsubscribe anytime.
worth a read
Mars For The Rest of Us — a weekly-or-more deep dive on the technical side of Mars exploration: rocket propulsion, microbiology, mission architecture, and everything in between. Written by Maciej Ceglowski.
Read it on Substack →