Back
0/1 Knapsack Algorithm
Dynamic Programming
Time: O(n×W)
Space: O(n×W)
Visualization
Step:
0
Initialize the visualization to begin
Items:
DP Table:
Maximum Value:
0
Selected:
Problem Setup
Capacity
Speed:
800
ms
Items (W, V)
+ Add
🎲 Random
Start Visualization
Playback
▶ Play
⏸ Pause
⏭ Step
↺ Reset
Pseudocode