lcs recursive

loiane · loiane · commit 39243c9ca92b · 2016-03-26T15:42:06.000-03:00
diff --git a/chapter11/09-LongestCommonSubsequenceRecursive.html b/chapter11/09-LongestCommonSubsequenceRecursive.html
@@ -0,0 +1,10 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta charset="UTF-8">
+    <title></title>
+</head>
+<body>
+<script src="09-LongestCommonSubsequenceRecursive.js"></script>
+</body>
+</html>
diff --git a/chapter11/09-LongestCommonSubsequenceRecursive.js b/chapter11/09-LongestCommonSubsequenceRecursive.js
@@ -0,0 +1,19 @@
+function lcs(wordwordX, wordwordY, m, n) {
+    
+    if (m == 0 || n == 0){
+        return 0;
+    }
+
+    if (wordwordX[m-1] == wordY[n-1]){
+        return 1 + lcs(wordX, wordY, m-1, n-1);
+    } else {
+        var a = lcs(wordX, wordY, m, n-1),
+            b = lcs(wordX, wordY, m-1, n);
+        return (a > b) ? a : b;
+    }
+}
+
+var wordX = 'acbaed',
+    wordY = 'abcadf';
+
+console.log(lcs(wordX, wordY, wordX.length, wordY.length));
