Skip to content
Open Model Lab

Search

Search concepts, topic pages, tracks, and guided paths from one place.

Type a concept, topic, starter track, guided collection, goal path, or subject. Narrow to one subject first when you want fewer results.

How to narrow it

You are focused on Computer Science -> Algorithms and Search. Type a title to find one page fast, or clear one filter to widen the search again.

Open Algorithms and SearchOpen Computer Science

Search scope

Searching inside Computer Science -> Algorithms and Search

Algorithms and Search is the tighter branch inside Computer Science. Clear Topic when you want the wider Computer Science branch again.

Open Algorithms and SearchOpen Computer Science

Search results

11 results for "Algorithms and Search".

Topic results

1 result

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.

Computer Science6 concepts
Open Algorithms and Search

Goal path results

1 result

Build computer-science intuition through algorithms and search

Use the algorithms-and-search topic page, the new playlist, the compact starter track, and the frontier-state revisit so the CS branch stays bounded while it grows into graph traversal.

Computer ScienceBuild intuition
Open goal path

Starter track results

1 result

Algorithms and Search Foundations

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.

Computer Science6 concepts
Open Algorithms and Search Foundations

Guided collection results

1 result

Algorithms and Search Playlist

Use the algorithms-and-search topic page, the compact starter track, one focused graph-traversal revisit, and filtered challenges so the CS branch stays bounded and extension-ready.

Computer SciencePlaylist
Open playlist

Subject results

1 result

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 Science1 topic
Open Computer Science

Concept results

6 results

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.

Computer ScienceAlgorithms and Search
Open Sorting trade-offs

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.

Computer ScienceAlgorithms and Search
Open Binary 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.

Computer ScienceAlgorithms and Search
Open Graph adjacency

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.

Computer ScienceAlgorithms and Search
Open BFS

Depth-First Search and Backtracking Paths

Keep the stack frontier, current depth, and branch order visible together so depth-first search feels like disciplined backtracking instead of random wandering.

Computer ScienceAlgorithms and Search
Open DFS

Frontier and Visited State on Graphs

Use one cyclic graph to see which nodes are waiting, which are finished, and why repeat edges are skipped instead of reopening loops.

Computer ScienceAlgorithms and Search
Open Frontier and visited