# topic/cs/algo

Approximate Nearest Neighbor Search

Exact nearest neighbor search in high dimensions is per query (brute-force scan). For millions of vectors, this is too slow. Approximate methods trade a small accuracy loss for…

Computer Science Foundations

Computer science foundations study the cost and structure of computation. The useful mental model is: algorithms transform inputs into outputs, data structures control access…

Dynamic Programming

Dynamic programming (DP) solves problems with optimal substructure (optimal solution built from optimal sub-solutions) and overlapping subproblems (same subproblems recur) by…

Graphs and Traversals

A graph consists of vertices and edges. Directed graphs (digraphs) have ordered edges. A DAG (directed acyclic graph) has no cycles.

Hash Tables

A hash table maps keys to values via a hash function , giving average-case lookup, insert, and delete.

Randomized Algorithms

Randomized algorithms use random choices to achieve better average-case performance, simpler implementations, or solutions to problems where deterministic approaches are…

Sorting and Selection

Sorting arranges elements in order. Selection finds the -th smallest (or largest) element without fully sorting.