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/DynamicProgramming/DyanamicProgrammingKnapsack.java at master · AmaranthLIS/Java Expand file tree/ Copy pathDyanamicProgrammingKnapsack.javaMore file actions 36 lines (31 loc) · 962 Bytes / Copy pathDyanamicProgrammingKnapsack.javaFile metadata and controls36 lines (31 loc) · 962 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 package DynamicProgramming; // A Dynamic Programming based solution // for 0-1 Knapsack problem public class DyanamicProgrammingKnapsack { static 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 static int knapSack(int W, int wt[], int val[], int n) { int i, w; int K[][] = new int[n + 1][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 public static void main(String args[]) { int val[] = new int[] {60, 100, 120}; int wt[] = new int[] {10, 20, 30}; int W = 50; int n = val.length; System.out.println(knapSack(W, wt, val, n)); } } |
| You are visitor 01402520 — 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. |