Given a set of items, each with a weight and a value. Knapsack algorithm determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible. Whereas in Knapsack 0-1 algorithm items cannot be divided which means either should take the item as a whole or should leave it.