Hi..
Can anyone here explain me /provide me with an algorithm/source code in C
which efficiently finds out the *longest common substring in the given
string??*
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email
Finding the longest common subsequence from two strings, is one of the
example in Dynamic Programming Chapter in INTRODUCTION ALGORITHMS by
Cormen.
It can be solved using a tabular and bottom-up approach:
LCS-LENGTH(X, Y)
m <- length[X]
n <- length[Y]
for i <- 1 to m
do c[i, 0] <- 0
for j <
