Visualizers

Watch comparisons and swaps happen live. Switch algorithms, control speed, and step through manually.

Watch low, high, and mid pointers narrow in on a target — or prove it's absent — by halving a sorted array each step.

Scan a list left to right, one element at a time, until the target turns up or the list runs out — no sorted-input requirement, unlike Binary Search.

Partition around a pivot so smaller elements land left and larger land right, then recurse — fast in practice, O(n²) on an unlucky pivot.

Recursively split the array in half, then merge the sorted halves back together — guaranteed O(n log n), at the cost of O(n) auxiliary space.

Count occurrences of each value directly instead of comparing elements — O(n + k) time when the value range k is small and known.

Repeated Counting Sort passes, one per digit, least significant first — builds on Counting Sort's bucket pattern.

Build a max-heap, then repeatedly extract the maximum into a shrinking sorted tail — O(n log n) with O(1) auxiliary space.

Watch single-source shortest paths get computed on a weighted graph — extract the nearest unvisited node, relax its edges, repeat.

See breadth-first search explore an unweighted maze grid, one queue pop at a time, until it finds the shortest (fewest-moves) path.

Watch the three-way SYN / SYN-ACK / ACK exchange that opens a reliable TCP connection between a client and a server.

Animates insert, balanced build, search, and delete on a live tree the learner can regenerate.