Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical
 
PerlMonks  

Re^4: Is it possible to find the number of matching and non-matching positions in strings using perl code?

by moritz (Cardinal)
on May 11, 2012 at 09:15 UTC ( #969947=note: print w/ replies, xml ) Need Help??


in reply to Re^3: Is it possible to find the number of matching and non-matching positions in strings using perl code?
in thread Is it possible to find the number of matching and non-matching positions in strings using perl code?

While it might be a single instruction, I'm pretty sure the number of ticks that is used up is still proportional to the length of the strings - you just can't wrap an O(n) operation in O(1) with finite hardware.


Comment on Re^4: Is it possible to find the number of matching and non-matching positions in strings using perl code?

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://969947]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (9)
As of 2014-10-21 14:08 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    For retirement, I am banking on:










    Results (104 votes), past polls