Longest Common Subsequence in C
#include<stdio.h>
#include<string.h>
int i,j,m,n,c[20][20];
char x[20],y[20],b[20][20];
void printFunction(int i,int j)
{
if(i==0 || j==0)
return;
if(b[i][j]=='c')
{
printFunction(i-1,j-1);
printFunctionf("%c",x[i-1]);
}
else if(b[i][j]=='u')
printFunction(i-1,j);
else
printFunction(i,j-1);
}
void LongComSub()
{
m=strlen(x);
n=strlen(y);
for(i=0;i<=m;i++)
c[i][0]=0;
for(i=0;i<=n;i++)
c[0][i]=0;
//c, u and l denotes cross, upward and downward directions respectively
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
{
if(x[i-1]==y[j-1])
{
c[i][j]=c[i-1][j-1]+1;
b[i][j]='c';
}
else if(c[i-1][j]>=c[i][j-1])
{
c[i][j]=c[i-1][j];
b[i][j]='u';
}
else
{
c[i][j]=c[i][j-1];
b[i][j]='l';
}
}
}
int main()
{
printf("Provide first sequence:");
scanf("%s",x);
printf("Provide second sequence:");
scanf("%s",y);
printf("\nThe LongComSub is ");
LongComSub();
printFunction(m,n);
return 0;
}
No comments:
Post a Comment