Glossary

8 short explanations of key terms used across the Algorithms learning path. Each entry answers "What is X?" in under 400 words.

Concepts build in layers: core techniques (sorting, binary search) → problem-solving strategies (recursion, memoization, dynamic programming, divide and conquer) → graph traversal (breadth-first search, depth-first search).

Every term links back to the lesson where it is introduced and to related entries in the Data Structures and Computation glossaries.