Merge pull request ephremdeme#359 from jaydulera/DP_Cutting_Rod_Problem

Added Cutting a Rod problem in Dynamic Programming

Author: ephremdeme

Dynamic Programming/CuttingARod.py

@@ -0,0 +1,20 @@
+import sys 
+
+def max(a, b): 
+return a if (a > b) else b 
+
+def cutRod(price, n): 
+if(n <= 0): 
+return 0
+max_val = -sys.maxsize-1
+
+for i in range(0, n): 
+max_val = max(max_val, price[i] + cutRod(price, n - i - 1)) 
+return max_val 
+
+
+arr = list(map(int , input().split()))
+size = len(arr) 
+print("Maximum Value that can be obtained is", cutRod(arr, size)) 
+
+# By Jay Dulera