[algorithm] Longest palindromic substring in Boost.Algorithm
Hello I want to add to Boost.Algorithm algorithm for finding all palindromes in a sequence in O(N). https://en.wikipedia.org/wiki/Longest_palindromic_substring Is it useful algorithm for Boost? Have you any suggestions? -- Best regards, Alexander Zaitsev
On 12-10-16 21:59, Зайцев Александр wrote:
Hello
I want to add to Boost.Algorithm algorithm for finding all palindromes in a sequence in O(N). https://en.wikipedia.org/wiki/Longest_palindromic_substring
Is it useful algorithm for Boost? Have you any suggestions?
Since you're the one who wants to add it, I presume you have reasons for it. What would be your arguments to have this algorithm in the library? Is there a known application domain? If so is it well served by this implementation?
participants (3)
-
Seth -
zamazan4ik＠tut.by -
Зайцев Александр