Smart Shopping Budget Optimizer
using 0/1 Knapsack Algorithm with Interactive Dynamic Programming Visualizer
Shopping Budget (Capacity):
Number of Items (n):
Item Names (comma separated):
Price (comma separated):
Values/Benifit (comma separated):
Generate Random Items
Solve Knapsack
Results
Dynamic Programming Table