Method rodcut

Leetcode/Java/RodCutting.java:16–26

(int price[], int n)

		System.out.println("Maximum Obtainable Value is " + rodcut(arr, size));
	}
	static int rodcut(int price[], int n)
	{
		if (n <= 0)
			return 0;
		int max = Integer.MIN_VALUE;

		for (int i = 0; i < n; i++)
			max = Math.max(max,	price[i] + rodcut(price, n - i - 1));

		return max;
	}
}