35+ classic algorithms animated step by step — searching, counting/radix/bucket sort, dynamic programming tables, greedy, backtracking, KMP, graph algorithms, max flow, and convex hull — with auto-play, next/prev stepping, adjustable interval, and pseudocode that highlights the running line.
Tip: use samples, upload, copy, download, and send-to actions inside the workspace where available.
Algorithm Academy is an interactive classroom for 30+ classic algorithms — searching, non-comparison sorting, dynamic programming, greedy strategies, backtracking, string matching, graph algorithms, and computational geometry. Every algorithm runs as a precomputed simulation you control: auto-play it, pause it, step forward and backward one operation at a time, or drag the scrubber to any moment. The pseudocode panel highlights the exact line being executed, every comparison shows a colored true/false verdict, and a plain-English narration explains each step — so you see not just WHAT the algorithm does, but WHY.
Six comparison sorts with sliding-bar animation, counters, and complexity cards.
Open toolDraw walls and weights, then watch each pathfinder explore.
Open toolAnimated BST/AVL insertions, deletions, rotations, and traversals.
Open toolEvery operation narrated with its real cost.
Open tool1Check a[0] = 23 — not 46, keep going.
for i = 0 .. n-1:if a[i] == target:return i # foundreturn not-found
Check each element until the target appears. The only option on unsorted data.
