Search
Type a concept, track, collection, topic, or subject. Narrow the branch first when you want a smaller result set.
Browsing Computer Science.
Search results
11 results for "Algorithms and Search Foundations".
Starter track results
1 resultStart 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.
Subject results
1 resultEnter 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.
Topic results
1 resultUse 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.
Guided collection results
1 resultUse the algorithms-and-search topic route, the compact starter track, one focused graph-traversal revisit, and the filtered challenge hub so the CS branch stays bounded and extension-ready.
Goal path results
1 resultUse the algorithms-and-search topic route, the new playlist, the compact starter track, and the frontier-state revisit so the CS branch stays bounded while it grows into graph traversal.
Concept results
6 resultsWatch sorting as visible work on a live list so input order, comparisons, and writes stay concrete instead of collapsing into one final answer.
Keep an ordered list, the low-mid-high markers, and the shrinking interval visible together so binary search feels visual instead of procedural.
Keep one live graph, one local neighborhood, and one frontier cue visible together so graph structure feels readable before traversal rules get formal.
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.
Keep the stack frontier, current depth, and branch order visible together so depth-first search feels like disciplined backtracking instead of random wandering.
Keep repeat skips, waiting frontier nodes, and already-expanded nodes visible together so cycle handling feels like honest bookkeeping on one graph bench.