This is a sample project for implementation LCS (Longest Common Subsequence) algorithm with C++ language programming
Description:
- Type first string like this => bcab
- Type second string like this => abc
- After you press enter, lcs algorithm calculated.
Result:
lenght of string for answer is : 2
result is :
bc
ab
Notice: This sample work at time O(n*m) find the largest common sub-sequence for the two strings.
For more information about LCS (Longest Common Subsequence) algorithm you can read this link: https://en.wikipedia.org/wiki/Longest_common_subsequence_problem