tag:blogger.com,1999:blog-865923359735383241.post2724125762242062667..comments2023-10-29T07:27:09.012-06:00Comments on Ccna final exam - java, php, javascript, ios, cshap all in one: Common sequences in two strings [closed]Unknownnoreply@blogger.comBlogger1125tag:blogger.com,1999:blog-865923359735383241.post-58377974393147098842012-02-14T19:06:13.615-07:002012-02-14T19:06:13.615-07:00It should be something simple, like this for examp...It should be something simple, like this for example:<br /><br /><br />search for B[i] in A. if it is found, go to 2 and assume j to be index for which B[i] == A[j]. else, repeat this step for i+1 (if B[i+1] exists)<br />check if B[i+1] exists. if it does, go to 3. else, finish the algorithm.<br />check if B[i+1] equals A[j+1]. repeat this step as long as it does. remember that every iteration is also a different common sequence<br /><br /><br />It may not be everything, but it's a good place to start.Userhttps://www.blogger.com/profile/11557173689529910046noreply@blogger.com