Longest Common Subsequence

소개글

Longest Common Subsequence에 대한 보고서 자료입니다.

목차

1. 개요

2. 문제 접근 과정

3. 실행 이미지

4. Source Code

본문내용

urn c[m][n];
}
void printLCS(int i,int j) {
if (i==0 || j==0) return;
if (b[i][j]==1) {
printLCS(i-1,j-1);
printf(\"%c\",X[i-1]);
}
else if (b[i][j]==2)
printLCS(i-1,j);
else
printLCS(i,j-1);
}
void main() {
while (1) {
printf(\"Input sequences.\\n\");
printf(\"Sequence 1: \");
gets(X);
printf(\"Sequence 2: \");
gets(Y);
printf(\"\\n********************************************************\\n\");
printf(\" Longest Common Subsequence \\n\");
printf(\"********************************************************\\n\\n\");
printf(\"\\n\\tLCS length -> %d \\t LCS : \",LCSlength());
printLCS(m,n);
printf(\"\\n\\n\");
exit(0);
}
}

키워드

Longest,   Common,   Subsequence