Complete search: enumerating candidate solutions · 1 of 3
Complete search technique
Recognise a complete search, write one over every pair, and count its candidates against the time limit before writing code.
Books1
Links2
- Basic Complete Search Complete search defined in a paragraph and applied to the largest distance between two of n points, with a note on counting each pair once and a set of practice problems. usaco.guide (opens in a new tab)
- Algorithms, Chapter 2: Backtracking Section 2.4 describes a search as a sequence of decisions and tries every possibility for each decision before making anything faster. Parts of this page adapt this chapter's text, licensed CC BY 4.0 (creativecommons.org/licenses/by/4.0), with changed wording, examples and code. jeffe.cs.illinois.edu (opens in a new tab)