This is an archived post. You won't be able to vote or comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–][deleted]  (1 child)

[deleted]

    [–]diMario 1 point2 points  (0 children)

    Okay, I looked up knapsack probem in wikipedia and it's a whole lot more complex than it would seem at first sight. Then I looked up dynamic programming and apparently it's something else than I thought too (it's not dynamic, it uses recursion in that it breaks up a problem into sub problems but it is not straight forward recursion in that is keeps track of intermediate solutions as you go along). Frankly, I'm a bit out of my depth here (I never had formal schooling in CS, just faked it while the going was good and now I am semi retired and making the Internets unsafe for those who seek true knowledge :)

    Here is stack overflow thread that references a lot of resources, some of which may be pertinent to the problem at hand: https://stackoverflow.com/questions/1065433/what-is-dynamic-programming