algorithm labs

Interactive labs for classic algorithms. Run them on your own input, follow the C++ line by line, and see why the complexity holds.

sorting bubble · insertion · selection · merge · quick · heap graph bfs · dfs · dijkstra · bellman-ford · prim · kruskal · topological sort dp basics · interval · tree DP · backtracking — naive vs memoized vs tabulated, with recursion trees bitwise and · or · xor · not · shifts · bit tricks — flip bits and watch the result auto-visualizer paste code + input, get a visualization — proof of concept