|
|
Boost : |
Subject: Re: [boost] [algorithm] Longest palindromic substring in Boost.Algorithm
From: Seth (bugs_at_[hidden])
Date: 2016-10-14 04:05:07
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?
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk