nabilthenoise/lcs

LCS is an algorithm to find the Longest Common Subsequence between two Strings.

LCS

LCS is an algorithm to find the Longest Common Subsequence between two Strings. for example, we can use this simple algorithm to find the most similar DNA to that of human or compare DNAs to find a match.(yeah i know thats cool :D)

How To Use:

it's very simple.

Amature way

1. Download or copy the code from LCS.cpp
2. Paste the copied code into you IDE (DevC++ or Visual Studio Community and etc.)
3. Run the code :)

Real Programmers Guid:

1. Download and save the file
2. Open your terminal and dir to your directory where the LSC.cpp is saved
3. Type: gcc LSC.cpp
4. After that, run a.exe file (actually gcc compiles the file and return an executable file so you can run it.)

Fetures:

You can see what's happening to your data and how we manage to get to the output we need!

Have fun!