A Dynamic programming solution for Rod Cutting problem - Java Algorithm

Java examples for Algorithm:Random

  1. HOME
  2. Java
  3. Algorithm
  4. Random

Description

A Dynamic programming solution for Rod Cutting problem

Demo Code


class RodCutting {
  // A function for calculating max of two nos.
  static int max(int a, int b) {
    return (a > b) ? a : b;
  }// ww w  .  j a v  a2  s.  com

  // Returns the max obtainable cost
  static int CutRod(int cost[], int n) {
    int[] val = new int[n + 1];
    int i, j;
    val[0] = 0;

    for (i = 1; i <= n; i++) {
      int max_value = Integer.MIN_VALUE;
      for (j = 0; j < i; j++)
        max_value = max(max_value, cost[j] + val[i - j - 1]);
      val[i] = max_value;
    }

    return val[n];
  }

  // Driver function

  public static void main(String args[]) {
    int[] arr = new int[] { 3, 5, 8, 9, 10, 17, 17, 20 };
    int size = arr.length;
    System.out.println("Maximum value is " + CutRod(arr, size));
  }
}

Related Tutorials