MaximumProductCutting.java

public class MaximumProductCutting {
  public int maxProdutRecursion(int n) {
    // base case
    if (n == 0 || n == 1) {
      return 0;
    }
    // make all possible cuts and get the maximum
    int max = 0;
    for (int i = 1; i < n; i++) {
      // Either this cut will produce the max product OR
      // we need to make further cuts
      max = Math.max(max,
          Math.max(i * (n - i), i * maxProdutRecursion(n - i)));
    }
    //return the max of all
    return max;
  }
  public static void main(String[] args) throws java.lang.Exception {
		MaximumProductCutting i = new MaximumProductCutting();
		System.out.println("Maximum Product: "+i.maxProdutRecursion(10));
	}
}