Method knapSack_01_Rec

Gfg/Java/Knapsack Problem.java:29–48

(int[] weight, int[] value, int cap, int n, int[][] dp)

		}
	}
	public static int knapSack_01_Rec(int[] weight, int[] value, int cap, int n, int[][] dp){
	    int N = n;
	    int Cap = cap;
	    for(n = 0;n<=N;n++){
	        for(cap = 0;cap<=Cap;cap++){
                if(cap == 0 || n == 0){
                    dp[n][cap] =0;
                    continue;
                }
                
                int maxProfit = 0;
                if(cap-weight[n-1]>=0){
                    maxProfit = Math.max(maxProfit,dp[n-1][cap-weight[n-1]]+value[n-1]);
                }
                maxProfit = Math.max(maxProfit, dp[n-1][cap]);
                dp[n][cap] = maxProfit;
	        }
	    }
	    return dp[N][Cap];
    }
}