Jump to text
On this page
Copy and source
Published source confirmed at last check

Source changed 2026-11-18 21:11:39 UTC · snapshot created 2026-11-18 21:12:35 UTC · last check 2026-11-18 22:50:20 UTC

CMP.11:8 - Common Anti-Patterns and How to Avoid Them

Tempting moveFailureUseful repair
Generalize from a slow implementationAnother algorithm may avoid its work.Prove a requirement for every admitted transcript or procedure.
Count distinct inputs without considering acceptable answersSeveral inputs may share one output.Count output-distinct classes.
Supply an inconsistent adversaryNo admitted input could produce its replies.Retain a nonempty compatible input family.
Fix randomness, then choose a different hard input for each seedThis can miss a successful randomized algorithm.Use one prior input distribution or a valid coupled argument.
Ignore input-dependent preprocessing or stronger accessThe algorithm already acquired the supposedly missing information.Charge or expose that resource and restate the model.