Matrix Chain Multiplication implemented in Python

matrix_chain_multiplication.py

@@ -0,0 +1,30 @@
+# Matrix chain multiplication using recursion
+
+import sys
+# Matrix A[i] has dimension p[i-1] x p[i]
+# for i = 1..n
+def MatrixChainOrder(p, i, j):
+	if i == j:
+		return 0
+	_min = sys.maxsize
+	# Place parenthesis at different places
+	# between first and last matrix, 
+	# recursively calculate count of multiplications 
+	# for each parenthesis placement 
+	# and return the minimum count
+	for k in range(i, j):
+		count = (MatrixChainOrder(p, i, k)
+				+ MatrixChainOrder(p, k + 1, j)
+				+ p[i-1] * p[k] * p[j])
+		if count < _min:
+			_min = count
+	# Return minimum count
+	return _min
+# Driver code
+if __name__ == '__main__':
+	arr = [1, 2, 3, 4, 3]
+	N = len(arr)
+	# Function call
+	print("Minimum number of multiplications is ",
+	MatrixChainOrder(arr, 1, N-1))
+# Code is contributed by Aviral Srivastava