suppose arr[i][j] says if string from i to j is a palindrome then arr[i][j] = (str[i]==str[j]) & arr[i+1][j-1]
then answer = max (abs(i-j) such that arr[i][j] =1) On Nov 28, 2007 12:49 AM, John <[EMAIL PROTECTED]> wrote: > > Algorithm for finding out the longest palindrome in a given string > using dynamic programming > > > > --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
