A reasoning language for algorithms, data structures, and proof.
The public Dictionary introduces the core CCF vocabulary. Master DSA members unlock applied examples, Case File references, proof translations, and code-level usage.
Public PreviewA glossary defines words. A reasoning dictionary explains how each concept helps you think, decide, repair, prove, and build correct solutions. In the CCF, terms are not labels to memorize; they are tools for seeing the structure of a problem.
Start with the terms the CCF uses to name reasoning decisions.
See how Intent, Frames, Constraints, Invariants, and Proof connect.
Use case files to practice the language inside real investigations.
Move into membership when you want structured practice and progression.
Name what information is, what must survive, and how lawful movement occurs before choosing a familiar technique.
A container is not a strategy. The same structure can hold original evidence, record facts for later frames, enforce an access law, or represent the answer. CCF classifies tools by the job they perform so selection follows evidence instead of pattern memory.
A data structure defines a form of evidence control. An algorithm defines the lawful procedure that operates on that evidence.
These structures contain the evidence the scanner must inspect.
These structures make relationships—not positions—the primary evidence.
These structures restrict which recorded item may be accessed next.
These preserve facts later frames cannot afford to rediscover.
These maintain enough organization to answer repeated selection, connectivity, or range questions efficiently.
An algorithm defines movement, decisions, repair, or construction. It acts on structures; it is not the structure itself.
| Category | Primary question | Examples |
|---|---|---|
| Evidence Space | Where does the original evidence live? | Array, String, List, Grid |
| Relationship Space | Which relationships define lawful routes? | Tree, Graph, Trie |
| Access Law | Which recorded item may be accessed next? | Stack, Queue, Deque |
| Recorder / Lookup | What fact must survive this frame? | Map, Set, Memo, Cache |
| Optimization / Query | What repeated query must stay efficient? | Heap, Union-Find, Range Trees |
| Algorithm / Procedure | How will the solution move and decide? | Scan, Search, BFS, DP |
A rule that must remain true while the solution runs.
Read EntryThe input area where the problem begins.
Read EntryThe area where the solution is built or discovered.
Read EntryThe movement mechanism that reads the problem space.
Read EntryThe memory that stores useful state or builds the answer.
Read EntryThe action that restores validity.
Read EntryThe final step that converts state into the required answer.
Read EntryThe reason we know the solution is correct.
Read EntryA structure that contains the original evidence.
Read EntryA structure whose connections carry the important evidence.
Read EntryA structure that controls which item may be accessed next.
Read EntryA structure that preserves facts for later frames.
Read EntryA finite procedure for producing a result.
Read EntryOne lawful action performed by a procedure.
Read EntryStarter members unlock expanded definitions and Case File references for the first 25 investigations.
Master DSA unlocks proof translations, code-level usage, common mistakes, and advanced decision checklists.
The dictionary gives you the language. CCF case files teach you how to apply that language to real algorithm, system, and software design problems.