public void Solve(IPlotter plotter)
{
// Given an array of N items, where each item is represented by a tuple (weight, value)
// Given a knapsack weight capacity
// Find the maximum total value in the knapsack without exceeding its capacity
// Items cannot be fractioned
ReadOnlySpan <Item> items = stackalloc Item[]
{
new Item {
Weight = 1, Value = 1
},
new Item {
Weight = 2, Value = 6
},
new Item {
Weight = 3, Value = 10
},
new Item {
Weight = 5, Value = 16
}
};
var capacity = 7;
var solution = _strategy.Solve(items, capacity);
plotter.PlotValues(nameof(items), items);
plotter.PlotValue(nameof(capacity), capacity);
plotter.PlotValues(nameof(solution), (ReadOnlySpan <Item>)solution);
plotter.PlotValue("total", solution.Sum(i => i.Value));
}
}
