exhaustive search
Trying every possible candidate solution and checking each one.
In more detail
It is guaranteed to find the answer but its cost is usually exponential or factorial. Backtracking with pruning explores the same space while skipping candidates that are already known to fail.
Related terms
- backtracking — A search technique that builds a solution one choice at a time and undoes the latest choice as soon as it cannot lead to a valid solution.
- brute force — Solving a problem by trying every possibility directly, without any clever structure.
- pruning — Abandoning a branch of a search as soon as a check shows it cannot lead to a valid or better solution.
Taught in
- Recognising The Common Growth Rates — Algorithms & Data Structures for Working Engineers
- Backtracking: Search With Pruning — Algorithms & Data Structures for Working Engineers
- Recognising The Pattern — Algorithms & Data Structures for Working Engineers