The 0/1 Knapsack Problem - Dynamic Programming Method

The Dynamic Programming method to solving the 0/1 Knapsack Problem.

Note: I uploaded the wrong version cos I'm an idiot. There are three bugs.

Bug 1: Ignore the "The cell with the green circle around has a capacity of" blah blah etc. because I uploaded the wrong version ._. The green circle should be around cell (3,1).
Bug 2: I circle item '1′ when I should circle item '3′ at the end when we're going through the keep array. I fail.
Bug 3: I say '2′ somewhere instead of '3′. See if you can spot it.

Видео The 0/1 Knapsack Problem - Dynamic Programming Method канала Mindez