One chart explains why O(n log n) passes while O(n²) times out at n=10⁵
cneuralnetwork · x · 2026-11-10
A compact explainer with a log-scale chart: at n=10⁵ and 10⁸ ops/sec, O(n) takes 1ms, O(n log n) 17ms, O(n²) 100 seconds, and O(n³) 116 days — visualizing why algorithmic complexity matters more than code that merely works.
More from Fun
- When Claude finishes the deployment and prod goes down — tekbog · 2026-11-10
- Concept: recursive self-improvement that still needs compaction — akbirthko · 2026-11-10
- Surreal AI-generated twisted tower images make the rounds — ciguleva · 2026-11-10
- After misspelling a prospect's name twice, he's sold on AI-assisted emails — HankYeomans · 2026-11-10
- Pelican meme math: past 200k tokens, long-context agent work stays on Luna — petrusenko_max · 2026-11-10
- Drake meme: refuse to train an email classifier, gladly build a sloppy Minecraft — victormustar · 2026-11-10