I created an interactive guide to help build intuition for recognizing time complexity from code patterns.
What's inside:
- Live code editor with visual feedback as you adjust input sizes
- Examples ranging from O(1) to O(n!) with interactive visualizations
- Coverage of core principles like "constants drop out" and "nested operations multiply"
- Master Theorem breakdown with practical examples
- Real algorithm analysis (merge sort, binary search, etc.)
The idea is simple: add op() markers to your code and watch the complexity curves appear as n increases. You can experiment with loops, recursion, or drop in your own algorithms to see how they scale.
Built with Next.js and deployed at https://sbondaryev.dev/articles/big-o-notation.
Feedback welcome!
Top comments (0)