knapsack

1 free lesson tagged knapsack across Computer Science. Each one is a short sequence of focused steps with narration and a five-question quiz at the end — take them in any order, no signup required.

Computer Science

advanced

Designing a Dynamic Program: State, Transition, Order

Writing a dynamic program is three decisions, not a recurrence to memorise. This lesson works through choosing the state, deriving the running time from it, fixing the evaluation order, recovering the answer rather than its value, and why an O(nW) knapsack is not polynomial.

9 steps·~14 min

Designing a Dynamic Program: State, Transition, Order

Related topics