Algorithms and Search Foundations
Not startedStart with visible list work, reuse that search language for binary search, and then carry the branch into one live graph bench for adjacency, BFS, DFS, and visited-state behavior.
Track recap
Compact review built from the authored track order and the same local-first concept progress already saved in this browser.
Start with visible list work, reuse that search language for binary search, and then carry the branch into one live graph bench for adjacency, BFS, DFS, and visited-state behavior.
About recap mode
Keep the authored order, then open the extra explanation only when you need to understand how recap is choosing the next review move.
How it works
Recap mode does not invent a second curriculum. It keeps the existing starter-track order, then changes the prompt and suggested action with the current mastery and progress signals.
Keep using concept pages
Recap links only jump you to the most useful surface for a fast review. The simulation-first concept pages still carry the real teaching work and keep the guided path intact.
Recap steps
Focus badges and button targets come from the current mastery and progress signals. The next ready checkpoint still stays in the loop.
Sorting and Algorithmic Trade-offs is still the next guided step in this authored order. No finished quick test, solved challenge, or completion mark is saved yet.
Start here before moving into Binary Search / Halving the Search Space.
This concept stays in the recap because it completes the authored track story, even if you have not reached it on this browser yet.
Builds on Sorting and Algorithmic Trade-offs before setting up Graph Representation and Adjacency Intuition.
This concept stays in the recap because it completes the authored track story, even if you have not reached it on this browser yet.
Builds on Binary Search / Halving the Search Space before setting up Breadth-First Search and Layered Frontiers.
This concept stays in the recap because it completes the authored track story, even if you have not reached it on this browser yet.
Builds on Graph Representation and Adjacency Intuition before setting up Depth-First Search and Backtracking Paths.
This concept stays in the recap because it completes the authored track story, even if you have not reached it on this browser yet.
Builds on Breadth-First Search and Layered Frontiers before setting up Frontier and Visited State on Graphs.
This concept stays in the recap because it completes the authored track story, even if you have not reached it on this browser yet.
Capstone step after Depth-First Search and Backtracking Paths.