Why a huge capacity breaks the table
Knapsack runs in O(n x W). With n = 100 items and a capacity of one
billion, the table is impossible.
What does that tell you?
Knapsack runs in O(n x W). With n = 100 items and a capacity of one
billion, the table is impossible.
What does that tell you?