0-1 knapsack

Cooperative Chimpanzee answered on December 27, 2021 Popularity 10/10 Helpfulness 1/10

answer 0-1 knapsack

0-1 knapsack

Comment

// A dynamic programming based
// solution for 0-1 Knapsack problem
#include <bits/stdc++.h>
using namespace std;
 
// A utility function that returns
// maximum of two integers
int max(int a, int b)
{
    return (a > b) ? a : b;
}
 
// Returns the maximum value that
// can be put in a knapsack of capacity W
int knapSack(int W, int wt[], int val[], int n)
{
    int i, w;
      vector<vector<int>> K(n + 1, vector<int>(W + 1));
 
    // Build table K[][] in bottom up manner
    for(i = 0; i <= n; i++)
    {
        for(w = 0; w <= W; w++)
        {
            if (i == 0 || w == 0)
                K[i][w] = 0;
            else if (wt[i - 1] <= w)
                K[i][w] = max(val[i - 1] +
                                K[i - 1][w - wt[i - 1]],
                                K[i - 1][w]);
            else
                K[i][w] = K[i - 1][w];
        }
    }
    return K[n][W];
}
 
// Driver Code
int main()
{
    int val[] = { 60, 100, 120 };
    int wt[] = { 10, 20, 30 };
    int W = 50;
    int n = sizeof(val) / sizeof(val[0]);
     
    cout << knapSack(W, wt, val, n);
     
    return 0;
}
 
// This code is contributed by Debojyoti Mandal

Popularity 10/10 Helpfulness 1/10 Language whatever

Source: www.geeksforgeeks.org

Tags: whatever

Link to this answer
Share Copy Link

Contributed on Dec 27 2021

Cooperative Chimpanzee

0 Answers Avg Quality 2/10

Closely Related Answers

0 - 1 Knapsack Problem

Comment

class Solution 
{ 
    //Function to return max value that can be put in knapsack of capacity W.
    static int knapSack(int W, int wt[], int val[], int n) 
    { 
         // your code here 
         int t[][]=new int[n+1][W+1];
         int i=0,j=0;
          for(i=0; i<W+1; i++) t[0][i] = 0;
        for(j=0; j<n+1; j++) t[j][0] = 0;
         
         for(i=1;i<n+1;i++)
         {
             for(j=1;j<W+1;j++)
             {
                 if(wt[i-1]<=j)
                 t[i][j]=Math.max(val[i-1]+t[i-1][j-wt[i-1]],t[i-1][j]);
                 else 
                 t[i][j]=t[i-1][j];
                 
                 
             }
         }
         return t[n][W];
         
         
             } 
}

Popularity 10/10 Helpfulness 1/10 Language whatever

Source: Grepper

Tags: knapsack-problem knap

Link to this answer
Share Copy Link

Contributed on Oct 19 2022

Sumit Rawal

0 Answers Avg Quality 2/10

0-1 knapsack

Contents

More Related Answers

0-1 knapsack

Closely Related Answers

0 - 1 Knapsack Problem

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.