Algorithms/Knapsack/NaiveKnapsackSolver.cs

using System;
using System.Collections.Generic;

namespace Algorithms.Knapsack;

//github.com/ <summary>
//github.com/     Greedy heurictic solver.
//github.com/ </summary>
//github.com/ <typeparam name="T">Type of items in knapsack.</typeparam>
public class NaiveKnapsackSolver<T> : IHeuristicKnapsackSolver<T>
{
    //github.com/ <summary>
    //github.com/     TODO.
    //github.com/ </summary>
    //github.com/ <param name="items">TODO. 2.</param>
    //github.com/ <param name="capacity">TODO. 3.</param>
    //github.com/ <param name="weightSelector">TODO. 4.</param>
    //github.com/ <param name="valueSelector">TODO. 5.</param>
    //github.com/ <returns>TODO. 6.</returns>
    public T[] Solve(T[] items, double capacity, Func<T, double> weightSelector, Func<T, double> valueSelector)
    {
        var weight = 0d;
        var left = new List<T>();

        foreach (var item in items)
        {
            var weightDelta = weightSelector(item);
            if (weight + weightDelta <= capacity)
            {
                weight += weightDelta;
                left.Add(item);
            }
        }

        return left.ToArray();
    }
}