Pooja2014-08-02T11:40:44+00:00//Program to implement knapsack problem using greedy method
What actually Problem Says ?
Given a set of items, each with a weight and a value.
Determine the number of each item to include in a collection so that the total weight is less than a given limit and the total value is as large as possible.
It derives its name from the problem faced by someone who is constrained by a fixed-size knapsack and must fill it with the most useful items.
Program :
[crayon-60fb94e87c60e529747925/]
Output [...]