0-1 knapsack implementation in python

zero_one_knapsack.py

# Author: [email protected]
# zero-one knapsack implementation in python


items = { 
    'a': (12,4)
    ,'b':(10,6)
    ,'c':(8,5)
    ,'d':(11,7)
    ,'e':(14,3)
    ,'f':(7,1)
    ,'g':(9,6) 
}

def knapsack(items, total_weight):
    B = [0 for _  in range(0,total_weight+1)] 
    for (benefit,current_weight) in items:
        print(B)
        for weight in range(total_weight,current_weight-1,-1):
            possible_benefit = B[weight-current_weight] + benefit
            if possible_benefit >= B[weight] :
                B[weight] = possible_benefit
    return B


tuple_list = list(items.values())
solution = knapsack(tuple_list,18)