decision procedure

A fixed series of questions that, answered in order, tells you which technique to try on an unfamiliar problem.

In more detail

The course asks: need every solution, then backtracking; optimal substructure with overlapping subproblems, then dynamic programming; a greedy-choice property as well, then greedy; independent halves, then divide and conquer. Earlier questions take priority. Verifying by running two approaches and comparing answers catches mistakes.

Related terms

Taught in

References