Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw
 
PerlMonks  

Re: Fast Identification Of String Difference

by FunkyMonk (Canon)
on Jan 18, 2011 at 01:41 UTC ( #882790=note: print w/replies, xml ) Need Help??


in reply to Fast Identification Of String Difference

the string can be longer than this
How long? The string length makes a huge difference in runtime.

But it is horribly slow
Define slow. Slow to some people might be really quick to others.
Typically I need to compare millions of such pairs
How 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

  • Comment on Re: Fast Identification Of String Difference

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://882790]
help
Chatterbox?
and the voices are still...

How do I use this? | Other CB clients
Other Users?
Others exploiting the Monastery: (6)
As of 2016-12-03 12:08 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    On a regular basis, I'm most likely to spy upon:













    Results (55 votes). Check out past polls.