Formulas you can watch, drag and take apart.

Drag the point, or switch to the rose curve r = cos kθ and watch it draw petals.

Drag to orbit a 3D scatter plot; the inset shows one ray from above. Try the dolly zoom.

Drag the endpoints; blend positions, plain numbers and colors.

Drag the control points; see de Casteljau's lerps of lerps and the Bernstein weights.

Pick one of 64 animals; slide the number of circles down and watch the details melt away.

Set amplitudes, frequencies and phase; δ drifts so the figure morphs and seems to turn in 3D.

Type up to six rows; every free letter gets a slider. Drag to pan, scroll to zoom; the code export contains your expressions.

Drag a node and watch the graph rebalance; hover a node for its force arrows.

Push the outlier up and watch every other bar get squashed; hover a bar for its calculation.

Click to zoom in, right-click to zoom out, drag to pan; hover to see a point's orbit.

Particles with fading trails follow the noise; hover to read the field, or show the vectors.

Draw and erase cells, load classic patterns, hover a cell to see the rule at work.

Drag to orbit; tune σ, ρ, β; follow up to three nearly identical starts as they part.

Move the mouse to find the nearest point, or switch to K-means and watch clusters form.

Drag the point; tilt the crowded month labels until they stop colliding.

Drag, add and remove seeds; Lloyd relaxation, Delaunay edges, giraffe, cracked-mud and dragonfly-wing styles.

Drag the basis tips and the grid warps; det shading, eigenvectors, presets, and a chain of up to three matrices.

Drag points, click to add, right-click to remove; residuals, squared errors and R².

The curve and its speed, a linear vs eased race, and bars gliding into place.

The heatmap picks black or white text for each cell; contrast ratios; WCAG linearization.

Neighbours swap until each pass carries the largest value to the end.

The smallest unsorted value (purple) is swapped to the front.

Each key slides left into place; try the Nearly sorted preset.

Split into halves, then merge them back; brackets show the recursion.

Partition around the pivot (pink), then sort each side.

Keys equal to the pivot gather in the middle; try Few unique.

The list drawn as a heap: build it, then pull out the largest each time.

Tally every value, then write the output straight from the counts.

Race the algorithms you pick, with live comparisons, moves and a measured time.

Explores in rings of equal distance, so its first path is the shortest in steps.

Dives down one corridor before backing up; finds a path, rarely the shortest.

Settles cells by total cost, so it walks around mud when a detour is cheaper.

Dijkstra steered by a straight-line guess of the distance left; visits fewer cells.

Insert, delete and find keys; toggle AVL; in-, pre- and post-order walks; rotations glide into place.

Takes edges by weight, keeping each one that joins two trees; drag the points.

Grows one tree from a vertex, always by the lightest edge leaving it.

Slide a, b and c; roots, vertex and axis; the Derive tab completes the square.

Four triangles slide around an (a + b)² square, or the altitude splits it into two copies.

The Taylor series as arrows spiralling onto the unit circle; θ = π gives e^(iπ) + 1 = 0.