|
|
|
| The stupid question is the question not asked | |
| PerlMonks |
Re: Fast Identification Of String Differenceby FunkyMonk (Abbot) |
| on Jan 18, 2011 at 01:41 UTC ( #882790=note: print w/ replies, xml ) | Need Help?? |
|
the string can be longer than thisHow long? The string length makes a huge difference in runtime.
But it is horribly slowDefine slow. Slow to some people might be really quick to others. Typically I need to compare millions of such pairsHow many millions? 1, 10, 100, 1,000? It all makes a difference. I think you need to show your code and some realistic data. I have basic substr-based code that will process your example data 100k+ times a second. That, to me, is fast
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||