Talk:Knapsack problem/Unbounded

From Rosetta Code
Revision as of 05:40, 3 December 2008 by rosettacode>Paddy3118 (Dynamic quite similar algorithm wise to exhaustive?)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Dynamic Python solution

Is the underlying algorithm so different from what I called an exhaustive search solution? I don't think so. P.S: should the line w = sack.volume; v = sack.volume have the first volume replaced by weight?

It's great that you thought the problem worthy of your time though. I spent ages trying to find something beginning with K and then on formulating the problem :-)

--Paddy3118 05:40, 3 December 2008 (UTC)

Retrieved from "https://rosettacode.org/wiki/Talk:Knapsack_problem/Unbounded?oldid=89803"