6.8 :)

algorithm problem

and viucus the length of the longest palindromic bonce. Tho r ae should be 6.8. Given two strings x 10...n and y = y1y2m , we wish to find the length of their longes common substring, that is, the largest k for which there are indices i and j with 131+1 2+k-1 = YjYj+1 4j+k-1. Show how to do this in time (mn). (a) Define the entries of your table in words. E.g., T(i) or T(i,j) is .... (b) State recurrence for entries of table in terms of smaller subproblems. (c) Write pseudocode for your algorithm to solve this problem. (d) Analyze the running time of your algorithm