UNIVERSITY CS FUNDAMENTALS

Algorithms are easier when you can see them move.

VisualizedAlgorithms exists to make the ideas behind algorithms visible: the comparisons, decisions, rotations, splits, and tradeoffs that are easy to miss in static notes.

Array algorithms Sorting Step through classic sorting algorithms from quadratic basics to divide-and-conquer workhorses. Search structures Trees Explore lookup, insertion, deletion, balancing, rotations, and multiway search-tree behavior. Networks and paths Graphs Watch traversal, relaxation, shortest paths, spanning trees, components, and heuristic search unfold. State transitions Dynamic Programming Build memo tables, recurrence grids, subsequence scores, edit distances, and optimal substructure one cell at a time. Local choices Greedy Follow sorted candidates, accepted choices, rejected conflicts, exchange arguments, and approximation coverage. Lookup strategies Searching & Hashing Inspect probes, collisions, chains, binary decisions, and probabilistic membership filters. Priority structures Heaps See priority queue operations bubble through array-backed and mergeable heap structures. Pattern matching String Algorithms Trace text scans, prefix tables, rolling hashes, suffix structures, and automata transitions. Recursive decomposition Divide & Conquer Split problems into subproblems, solve base cases, and combine results step by step. Spatial algorithms Computational Geometry Watch hulls, sweep lines, intersections, closest pairs, and spatial partitions emerge.