dzanotelli / knapsack Goto Github PK

Write a function which returns the combination where

• items is a pointer to a list of integers;
• k is the count of the items in each selected subset;
• repetitions are not allowed.

The function will get items (int*) and k (int) as parameters and return a pointer to an array of int where all the possible combination are stored.

Write a function which compute the payoff
Input: the array of elements, the permutation
output: the payoff value (integer)
constraint: total weight <= knapsack weight

Write a function which will compute the permutations of a list of integers.

Complete the main program:

• computing the payoff for each permutation
• choosing the highest
• printing choice to stdout