DSA Visualizers
Watch algorithms actually run
Reading a description of how binary search narrows its range is one thing; watching it happen, one comparison at a time, is another. Every visualizer here computes the real sequence of steps a real algorithm takes — play it, pause it, step through it manually, or change the input and watch it adapt.
Sorting Algorithms
Bubble, selection and insertion sort — watch each comparison and swap.
Binary Search
Watch the search range shrink by half with every comparison.
Linked List
Traverse, insert and delete nodes, and see why each costs what it costs.
Stack & Queue
LIFO vs FIFO, made visible: push/pop against enqueue/dequeue.
Recursion & the Call Stack
Watch a recursive function's calls stack up, then unwind.
Graph Search (BFS/DFS)
The same graph, two traversal orders — see exactly where they diverge.
Want to write the code behind these yourself? Practice problems put several of these exact patterns in front of a real editor, graded against hidden tests.