Knapsack 0/1 and Unbounded

KnapSack.cs

    public static partial class DynamicProgramming
    {
        public static int KnapSack_01(Tuple<int, int>[] valueWeightTuple, int maxWeight)
        {
            int[,] dp = new int[valueWeightTuple.Length + 1, maxWeight + 1];

            for (int i = 0; i <= maxWeight; ++i) dp[0, i] = 0;

            for (int i = 1; i <= valueWeightTuple.Length; i++)
            {
                int itemValue = valueWeightTuple[i - 1].Item1;
                int itemWeight = valueWeightTuple[i - 1].Item2;

                for (int j = 0; j <= maxWeight; j++)
                {
                    if (itemWeight > j)
                        dp[i, j] = dp[i - 1, j];

                    else
                    {
                        dp[i, j] = Math.Max(dp[i - 1, j], dp[i - 1, j - itemWeight] + itemValue); 
                    }
                }
            }

            return dp[valueWeightTuple.Length, maxWeight];
        }

        public static int KnapSack_Unbounded(Tuple<int, int>[] valueWeightTuple, int maxWeight)
        {
            throw new NotImplementedException();
        }
    }