wild-inter.net
Knapsack · DP over capacities
Knapsack · DP over values
SubsetSum
SubsetSum over ℤ
Partition
MakingChange
Small screen:
this is the compact demo — the table, the scrubber and the picture. The pseudocode with live line highlighting is on the desktop version.
Example
Random instance
Detail
One step per row
One step per cell
Every guess
all optimal arrows
Back to the whole problem
Arrow keys step; hover a cell to preview it, click to backtrace from it.
↺
⏮︎
⏭︎
▶︎
— / —
Speed
520ms
The table V[n′, b′]
Why “pseudo”polynomial
The subproblem, pictured
What just happened
Solution T
Recurrence & pseudocode
Input
Load