[Haskell-beginners] Longest palindrome

[Thomas Miedema]

see the section "A naive algorithm for finding palindromes" in this
blogpost:

http://johanjeuring.blogspot.com/2007/08/finding-palindromes.html


On Mon, Oct 11, 2010 at 7:54 PM, Lyndon Maydwell <maydwell at gmail.com> wrote:

> Hi Café.
>
> I've been looking at implementing the following algorithm in haskell.
>
> Take the maximum length palindrome from the list of palindromes
> generated from the original list by:
> Taking each element as a starting point, then expanding either side
> while the string is still a palindrome.
>
> I could do this numerically after generating an array from a list, but
> I was wondering if there was a more idiomatic way to go about it.
> _______________________________________________
> Beginners mailing list
> Beginners at haskell.org
> http://www.haskell.org/mailman/listinfo/beginners
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.haskell.org/pipermail/beginners/attachments/20101011/eeb9510e/attachment-0001.html