GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — Java/Dynamic Programming/Knapsack.java at master · ErrorMode/Java Expand file tree/ Copy pathKnapsack.javaMore file actions 38 lines (32 loc) · 783 Bytes / Copy pathKnapsack.javaFile metadata and controls38 lines (32 loc) · 783 Bytes 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 // A Dynamic Programming based solution for 0-1 Knapsack problem public class Knapsack { private static int knapSack(int W, int wt[], int val[], int n) { int i, w; int rv[][] = new int[n+1][W+1]; //rv means return value // Build table rv[][] in bottom up manner for (i = 0; i <= n; i++) { for (w = 0; w <= W; w++) { if (i==0 || w==0) rv[i][w] = 0; else if (wt[i-1] <= w) rv[i][w] = Math.max(val[i-1] + rv[i-1][w-wt[i-1]], rv[i-1][w]); else rv[i][w] = rv[i-1][w]; } } return rv[n][W]; } // Driver program to test above function public static void main(String args[]) { int val[] = new int[]{50, 100, 130}; int wt[] = new int[]{10, 20, 40}; int W = 50; int n = val.length; System.out.println(knapSack(W, wt, val, n)); } } |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |