Just shipped something I'm genuinely proud of, I call it AlgoTracker I've always struggled to truly understand Big O Notation just by reading about it. So I built a visual tool to help me see it in action. What it does: Linear Search O(N) and Binary Search O(log N) Selection Sort and Insertion Sort O(N²) A time complexity graph that runs each algorithm, measures how long it takes, and compares them visually based on input size A step-by-step visualizer so you can watch exactly how data gets sorted or searched The time complexity graph is my favourite feature, you can literally see which algorithm is faster as you increase the data size. Built it using Recharts for the graph visuals. This project started as a learning tool for myself, but I think it could help any developer who learns better by seeing rather than just reading. Live demo: https://lnkd.in/djuGe-tJ GitHub: https://lnkd.in/dmrribMi Built with React · Tailwind CSS v4 · Recharts · Node.js #webdeveloper #javascript #react #buildinpublic #opensource

To view or add a comment, sign in

Explore content categories