From c006f06d22c57fba8abde88525d0e4b654e5bb31 Mon Sep 17 00:00:00 2001
From: HitIt007 <68337377+HitIt007@users.noreply.github.com>
Date: Sun, 3 Oct 2021 20:43:03 +0530
Subject: [PATCH] Lcs.cpp

Largest common sequence algorithm implemented in cpp
---
 C++/LCS.cpp | 31 +++++++++++++++++++++++++++++++
 1 file changed, 31 insertions(+)
 create mode 100644 C++/LCS.cpp

diff --git a/C++/LCS.cpp b/C++/LCS.cpp
new file mode 100644
index 00000000..e64d2f18
--- /dev/null
+++ b/C++/LCS.cpp
@@ -0,0 +1,31 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int LCS( int *X, int *Y, int m, int n )
+{
+    if (m == 0 || n == 0)
+        return 0;
+    if (X[m-1] == Y[n-1])
+        return 1 + lcs(X, Y, m-1, n-1);
+    else
+        return max(lcs(X, Y, m, n-1), lcs(X, Y, m-1, n));
+}
+
+int max(int a, int b)
+{
+    return (a > b)? a : b;
+}
+
+
+int main()
+{
+    int  X[] = {1,2,3,4,5,6,7,8,9,0};
+    int  Y[] = {1,2,5,8,9,3,4,6,7,0};
+
+    int m = X.size();
+    int n = Y.size();
+
+    cout<<"Length of LCS is "<< lcs( X, Y, m, n ) ;
+
+    return 0;
+}