Just another Perl shrine | |
PerlMonks |
Re: Re: Junk NOT wordsby Anonymous Monk |
on Nov 01, 2002 at 16:26 UTC ( [id://209771]=note: print w/replies, xml ) | Need Help?? |
The problem with this algorithm, is that it has a VERY bad worse case performance, it's in O(2^n), where n is the length of the string. Meaning that as the strings get larger, this problem will become insolvable by deterministic methods. Some sort of heuristic is needed.
In Section
Seekers of Perl Wisdom
|
|