Question

In Python, write the following function:

Knapsack Problem:

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 or equal to a given limit and the total value is maximized.

Answer 1

Solution:

code:

def KnapSack(M, weight, value, num):

#The base case

    if num == 0 or M == 0 :

        return 0

    if (weight[n-1] > M):

        return KnapSack(M, weight, value, num-1)

    else:

        return max(value[n-1] + KnapSack(W-weight[n-1], weight, value, num-1),

                   KnapSack(M, weight, value, num-1))

Hit the thumbs up if you liked the answer. :)