Given a Knapsack with capacity M=20 and four items with weights
and profits like: w(18, 15, 10, 4), p(25,24,15,9), some of which
will be selected into this knapsack such that the sum of profits be
maximum using greedy algorithm.
Given a Knapsack with capacity M=20 and four items with weights and profits like: w(18, 15, 10, 4), p(25,24,15,9), some
-
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am