Classical Algorithms
The foundations of computer science
Binary search, sorting, graph traversal, and shortest paths — visualized step by step with full code synchronization.
Interactive, step-by-step dissection of deep learning, generative AI, and quantum algorithms. Watch every computation unfold — from binary search to self-attention.
No account required · MIT Licensed · Python & JavaScript
Apply Oracle: The oracle flips the phase of the target state |101⟩, marking it for amplification.
Choose from 22+ algorithms across classical CS, deep learning, generative AI, and quantum computing.
Step through every computation at your own pace. See the code, the data structures, and the explanation — all in sync.
Modify inputs, compare algorithms, and experiment until you truly understand how it works — not just what it does.
Not just pretty animations — every feature is designed to help you build genuine intuition about how algorithms work.
Every computation, at your own pace
Play, pause, step forward, step backward, and scrub through any algorithm. Each step shows what changed and why — so you never lose track of the logic.
See the exact line being executed
Every visualization step highlights the corresponding line of code. The connection between what you see and how it works is never broken.
1function binarySearch(arr, target) {2 let low = 0, high = arr.length - 1;3 while (low <= high) {4 let mid = Math.floor((low+high)/2);5 if (arr[mid] === target) return mid;6 if (arr[mid] < target) low = mid+1;7 }8}
Line 4: Compute the midpoint index. Using Math.floor ensures an integer index when the array has even length.
Understand the why, not just the what
Every step includes a human-readable explanation of what just happened. No jargon walls — just clear reasoning that builds genuine intuition.
What's happening: The word "cat" attends most strongly to "The" (0.7) because the model has learned that determiners modify the next noun. This is how self-attention builds context.
From sorting algorithms to self-attention — explore every domain with the same interactive, step-by-step experience.
The foundations of computer science
Binary search, sorting, graph traversal, and shortest paths — visualized step by step with full code synchronization.
Neural networks from neuron to network
Watch signals propagate through neurons, see backpropagation compute gradients, and understand convolution at the pixel level.
Transformers and attention, demystified
See how text becomes tokens, tokens become embeddings, and attention computes which words matter to each other.
Qubits, gates, and superposition
Bloch spheres, quantum gates, and algorithms like Grover's search — visualized in ways that build real intuition.
Build custom visualizations in the browser editor, or integrate into your existing Python and JavaScript workflows.
Write JavaScript using the step() API. Choose from 13 built-in visualization layouts.
const arr = [14, 27, 3, 42];for (let i = 0; i < arr.length; i++) {step({ title: `Check ${i}` });}
Use the same visualizations in Jupyter notebooks, Python scripts, or any JavaScript project.
import eigenvueeigenvue.show("self-attention")eigenvue.jupyter("transformer")
pip install eigenvuenpm install eigenvueNo account needed. No installation required. Pick an algorithm and start learning.