#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/dynamic-programming/knapsack/0-1-knapsack-implementation

░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█████████████████████████████████████████████████████████████████████████████████████

#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/dynamic-programming/knapsack/0-1-knapsack-implementation

Repovive

0/1 Knapsack - Implementation - Knapsack | Dynamic Programming | Repovive

Repovive.

Dynamic Programming21 sections · 918 units60h total

Open in Course

0/1 Knapsack - Implementation

The code

Here's the complete solution:

for i from 1 to n: for w from 0 to W: if w[i] <= w: dp[i][w] = max(dp[i-1][w], dp[i-1][w-w[i]] + v[i]) else: dp[i][w] = dp[i-1][w]
return dp[n][W]

Time: $O(n \cdot W)$ . Space: $O(n \cdot W)$ .

You can reduce space to $O(W)$ by noticing each row only depends on the previous row. Process weights from $W$ down to $0$ to avoid overwriting values you still need. The implementation follows directly from the transition formula. Each line of code corresponds to part of the mathematical formula. Walk through a small example step by step to verify your understanding.