Skip to content

Tech Blog

All about computer technology

Longest Common Subsequence

https://www.youtube.com/watch?v=NnD96abizww

if (input1[i] == input2[j]) {
    M[i][j] = M[i-1][j-1] + 1
} else {
    M[i][j] = max(M[i-1,j], M[i,j-1])
}
Posted on April 3, 2017April 3, 2017Author shahprashantCategories Algorithms

Post navigation

Previous Previous post: Sort Algorithms
Next Next post: What are B-Trees
Proudly powered by WordPress