NaiveKnapsackSolver.cs

usingSystem;
usingSystem.Collections.Generic;

namespaceAlgorithms.Knapsack;

/// <summary>
/// Greedy heurictic solver.
/// </summary>
/// <typeparam name="T">Type of items in knapsack.</typeparam>
publicclassNaiveKnapsackSolver<T>:IHeuristicKnapsackSolver<T>
{
/// <summary>
/// TODO.
/// </summary>
/// <param name="items">TODO. 2.</param>
/// <param name="capacity">TODO. 3.</param>
/// <param name="weightSelector">TODO. 4.</param>
/// <param name="valueSelector">TODO. 5.</param>
/// <returns>TODO. 6.</returns>
publicT[]Solve(T[]items,doublecapacity,Func<T,double>weightSelector,Func<T,double>valueSelector)
{
varweight=0d;
varleft=newList<T>();

foreach(variteminitems)
{
varweightDelta=weightSelector(item);
if(weight+weightDelta<=capacity)
{
weight+=weightDelta;
left.Add(item);
}
}

returnleft.ToArray();
}
}