RodCuttingRecursion.java

public class RodCuttingRecursion {
    public static int profit(int[] value, int length) {
        if (length <= 0)
          return 0;
          // either we will cut it or don't cut it
          int max = -1;
          for(int i=0;i<length;i++)
            max = Math.max(max, value[i] + profit(value, length-(i+1)));			
          return max;		
      }
      public static void main(String[] args) {
        int[] value = { 2, 3, 7, 8, 9 };
        int len = 5;
        System.out.println("Max profit for length is " + len + ":"
            + profit(value, len));
      }
}