Skip to content
HomeConcept librarySubjectsComputer Science
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.

Starter tracks

Start with a bounded path before branching wider.

Open concept library
Starter track6 concepts138 min2 checkpoints

演算法與搜尋基礎

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.

1排序與演算法取捨
Start here
2二分搜尋/把搜尋空間減半
Ahead
3圖的表示法與鄰接直覺
Ahead
4廣度優先搜尋與分層前沿
Ahead
5深度優先搜尋與回溯路徑
Ahead
6圖上的前沿與已訪狀態
Ahead

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

Best first concepts

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

電腦科學演算法與搜尋

排序與演算法取捨

把排序看成對即時列表的可見工作,使輸入順序、比較次數與寫入動作都保持具體,而不是只剩最後答案。

電腦科學演算法與搜尋

二分搜尋/把搜尋空間減半

把有序列表、low-mid-high 標記與不斷縮小的區間一起留在視野中,讓二分搜尋變得可視,而不只是流程步驟。

電腦科學演算法與搜尋

圖的表示法與鄰接直覺

把同一張即時圖、局部鄰域與前沿提示一起保留,讓圖結構在正式談遍歷規則前就已經可讀。

電腦科學演算法與搜尋

廣度優先搜尋與分層前沿

把佇列前沿、已訪計數與圖層一起顯示,讓廣度優先搜尋讀起來像分層推進的過程,而不是步驟清單。