Skip to content
HomeConceptsComputer ScienceAlgorithms and Search Foundations

Track recap

Track recap138 min

Algorithms and Search Foundations

Not started

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

Same authored sequence, lighter revisit.

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

Quick tests, challenge mode, worked examples, and read-next stay where they already live.

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

Revisit the track in the same authored order.

Focus badges and button targets come from the current mastery and progress signals. The next ready checkpoint still stays in the loop.

  1. 1Not startedNewNext guided step

    Sorting and Algorithmic Trade-offs

    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.

    Sorting as a processComparisons and writes24 min
  2. 2Not startedNewAhead

    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.

    Ordered data mattersLow mid high22 min
  3. 3Not startedNewAhead

    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.

    Local neighborsFirst frontier22 min
  4. 4Not startedNewAhead

    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.

    Queue frontierLayered search24 min
  5. 5Not startedNewAhead

    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.

    Stack frontierBranch-first depth24 min
  6. 6Not startedNewAhead

    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.

    Frontier vs visitedRepeat skips22 min