Sorting Algorithms
Compare adjacent swaps, selected minimums, inserted keys, merges, partitions, and heap extraction with one shared visualizer.
Interactive study section
Algorithms and cryptography as hands-on lessons: run the process, inspect each step, compare complexity, and answer short checks inside the same flow.
Tracks
The first version focuses on sort visualizers and cryptography playgrounds. The structure leaves room for graphs, data structures, probability, and machine learning later.
Compare adjacent swaps, selected minimums, inserted keys, merges, partitions, and heap extraction with one shared visualizer.
Place O(n), O(n log n), and O(n^2) side by side so growth rate differences are visible before code timing gets noisy.
Move from Caesar and Vigenere to XOR, RSA, key exchange, and hashing with parameter controls and step cards.
Current map
Next extension
This version is intentionally browser-first. Firestore progress and Cloud Functions for AI-generated questions can be added without changing the lab routes.