Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris
 
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 web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others about the Monastery: (9)
As of 2015-07-02 01:55 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (25 votes), past polls