matrixChainOrder recursive

loiane · loiane · commit 4828b9f7f9a4 · 2016-03-26T15:42:27.000-03:00
diff --git a/chapter11/11-MatrixChainMultiplicationRecursive.html b/chapter11/11-MatrixChainMultiplicationRecursive.html
@@ -0,0 +1,10 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta charset="UTF-8">
+    <title></title>
+</head>
+<body>
+<script src="11-MatrixChainMultiplicationRecursive.js"></script>
+</body>
+</html>
diff --git a/chapter11/11-MatrixChainMultiplicationRecursive.js b/chapter11/11-MatrixChainMultiplicationRecursive.js
@@ -0,0 +1,26 @@
+function matrixChainOrder(p, i, j){
+
+    if(i == j) {
+        return 0;
+    }
+
+    var k, count,
+       min = Number.MAX_SAFE_INTEGER;
+
+    for (k = i; k <j; k++) {
+        count = matrixChainOrder(p, i, k) +
+            matrixChainOrder(p, k+1, j) +
+            p[i-1]*p[k]*p[j];
+
+        if (count < min){
+            min = count;
+        }
+    }
+
+    return min;
+}
+
+var p = [10, 100, 5, 50, 1],
+    n = p.length;
+
+console.log(matrixChainOrder(p, 1, n-1));
