Sorting Algorithm Analyzer

Sorting algorithms are taught as pseudocode and Big-O tables. Students memorize the complexity but never feel why merge-sort is O(n log n). Nothing about the recursion is visible.

Hand-rolled a Canvas2D engine that animates each comparison, swap, and merge step with eased motion. Splits the array recursively in real time so the divide-and-conquer tree becomes visible. Configurable array size, animation speed, and color states (compared / merging / settled).

Used live in tutoring sessions. Students consistently report 'it clicked' the moment they see the recursion play out — exactly the goal.