Binary Search
Boundary search over sorted random-access data or monotone predicates.
Boundary search over sorted random-access data or monotone predicates.
Layered graph traversal and shortest paths by edge count.
Stack-based graph traversal, parent structure, and DFS-specific guarantees.
Sequential lookup without ordering or preprocessing assumptions.
Find Markdown notes with keyword, semantic, or hybrid search, then read the source behind each result.
A decision map for lookup, ordered search, and graph traversal.
Combine semantic discovery and keyword search to locate relevant workspace files, then verify the current source.