Show HN: Big O Notation – An Interactive Guide

Hi HN,

I built this interactive guide to help build intuition for time complexity.

There is already a lot of writing on this topic here (e.g. [1], [2]), so I tried to keep the explanation minimal and focus on examples you can interact with.

The visualizer runs your JavaScript code, tracks `op()` markers as `n` increases, and plots the growth curve in real-time.

I also tried to visualize the Master Theorem by mapping recursion trees to the work done at each level.

I'd love to hear your feedback on the visualizations or if you find the Master Theorem section intuitive.

[1] https://news.ycombinator.com/item?id=5655075 [2] https://news.ycombinator.com/item?id=45002182