lcs using recursinon

#include <bits/stdc++.h>
using namespace std;
int check=0;
int lcs(string X, string Y, int m, int n)
{
    check++;
    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 main()
{
    string X = "AGGTAB";
    string Y = "GXTXAYB";

    int m = X.length();
    int n = Y.length();

    cout << "Length of LCS: " << lcs(X, Y, m, n);
    cout<<endl<<check<<endl;
    return 0;
}