more useful options | |
PerlMonks |
Re: Re: Re: finding longest common substringby tilly (Archbishop) |
on Nov 20, 2003 at 06:49 UTC ( [id://308526]=note: print w/replies, xml ) | Need Help?? |
I guess that I had somewhat more overhead than I realized. I'll think about whether I can improve on that. :-( Incidentally my solution compares much better than others if you make the input strings much longer than the common substrings. For instance if the common match is "The quick brown fox" and the strings are each a few hundred characters, I win by a wide margin.
In Section
Seekers of Perl Wisdom
|
|