Subject entry1 topics6 concepts1 starter track138 min

Computer Science

Enter the current computer-science slice through one bounded algorithms-and-search branch where visible list work now widens into one shared graph-traversal bench without leaving the product's simulation-first architecture.

Computer Science is still intentionally compact, but it now has more than a two-concept pilot. This subject frames one coherent algorithms-and-search branch so sorting, binary search, graph adjacency, BFS, DFS, and visited-state bookkeeping feel native to the same topic, track, guided, and search seams already used elsewhere on the site.

Start Algorithms and Search Foundations Open Algorithms and Search New here? Start here Search Computer Science Browse Computer Science concepts

Starter tracks

Start with a bounded path before branching wider.

Open concept library

Starter track6 concepts138 min2 checkpoints

Algorithms and Search Foundations

Track 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.

Visible sorting workComparisons and writesOrdered-data searchHalving the intervalGraph frontiersBFS vs DFS

Track progress

0 of 8 moments complete

0 of 6 concepts complete and 0 of 2 checkpoints cleared.

1Sorting and Algorithmic Trade-offs

Start here

2Binary Search / Halving the Search Space

Ahead

3Graph Representation and Adjacency Intuition

Ahead

4Breadth-First Search and Layered Frontiers

Ahead

5Depth-First Search and Backtracking Paths

Ahead

6Frontier and Visited State on Graphs

Ahead

Sorting and Algorithmic Trade-offs opens this track and sets up the rest of the path.

Start track Jump to Sorting trade-offs

Topics

Use topics when you want the subject shaped into a clearer map.

TopicComputer Science6 concepts138 min1 starter track

Algorithms and Search

Use one bounded CS branch where visible list work grows into one coherent graph-traversal bench, so sorting, binary search, adjacency, BFS, DFS, and visited-state behavior stay on compact live surfaces.

Sorting as visible workHalving an ordered intervalGraph neighborhoods and adjacency

Best first concepts

Sorting trade-offs Binary search Graph adjacency

Open topic Start Sorting trade-offs

Best first concepts

Start with one strong concept when you do not need the full path yet.

Computer ScienceAlgorithms and Search

Sorting and Algorithmic Trade-offs

Watch sorting as visible work on a live list so input order, comparisons, and writes stay concrete instead of collapsing into one final answer.

Open Sorting trade-offs

Computer ScienceAlgorithms and Search

Binary Search / Halving the Search Space

Keep an ordered list, the low-mid-high markers, and the shrinking interval visible together so binary search feels visual instead of procedural.

Open Binary search

Computer ScienceAlgorithms and Search

Graph Representation and Adjacency Intuition

Keep one live graph, one local neighborhood, and one frontier cue visible together so graph structure feels readable before traversal rules get formal.

Open Graph adjacency

Computer ScienceAlgorithms and Search

Breadth-First Search and Layered Frontiers

Keep the queue frontier, visited count, and graph layers visible together so breadth-first search reads as a layered process instead of a procedure list.

Open BFS