Thread: 0-1 knapsack problem

Hi,
I am looking for a C source code that can implement dynamic programming for 0-1 knapsack problem. briefly the knapsack problem is as follows;

The knapsack can contain at most 100kg and here are the objects in the market.
Name Weight Value
A 45 3
B 40 5
C 50 8
D 90 10
The optimal solution will be taking objects B and C from the market. WB:40, WC:50 (40+50<100) and
values of objects B and C WB:5, WC:8. (with total value 5+8=13)
thank you.

Originally Posted by madennn

Hi,
I am looking for a C source code that can implement dynamic programming for 0-1 knapsack problem. briefly the knapsack problem is as follows;

The knapsack can contain at most 100kg and here are the objects in the market.
Name Weight Value
A 45 3
B 40 5
C 50 8
D 90 10
The optimal solution will be taking objects B and C from the market. WB:40, WC:50 (40+50<100) and
values of objects B and C WB:5, WC:8. (with total value 5+8=13)
thank you.

Read this --> C Board - Announcements in Forum : General Programming Boards

Moreover, you won't learn a thing using scoop and poop (copy and paste) coding. It won't make you a good programmer, it will make you a good thief who can't program.