Library / Computational Thinking DPF
Jump to passage
In this reading

Link to current text

Published source confirmed at last check

Source changed 2026-10-03 02:22:15 UTC · snapshot created 2026-10-03 03:38:22 UTC · last check 2026-10-03 04:30:10 UTC

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

Misstep exposed by the methodConsequence and repair
Turn an improving direction into an arbitrary finite stepThe quadratic example can oscillate or diverge. Derive step extent or supply an adaptive rule with stated conditions.
Stop solely because successive values barely changeA tiny step can hide a large unresolved error. Connect the stopping quantity to the result by a bound.
Demand zero full gradient at a constrained optimumThe interval example is optimal with a nonzero derivative. Use feasible variations or the appropriate projected condition.
Infer global optimality from a local stopThe neighborhood may miss a better distant candidate. Derive a global comparison or retain the local conclusion.
Treat finite termination as a useful runtime boundThe finite state space or potential may be enormous. Account for encoded magnitude and work per step.