in reply to Re^2: Finding longest palindrome from a string
in thread Finding longest palindrome from a string

Unfortunately, the benchmark doesn't tell the whole story. Many of the regex-based solutions fail on unescaped regex characters.

All of the faster ones fail to correctly find the longest string when fed either of:

1111111121111111111112111111111111111111111112111111111111211111 ababacababacadacababacadaeadacabaz

(Including mine, which is sad, as the first one is my publish test string:()

Examine what is said, not who speaks.
"Efficiency is intelligent laziness." -David Dunham
"Think for yourself!" - Abigail
"Memory, processor, disk in that order on the hardware side. Algorithm, algorithm, algorithm on the code side." - tachyon