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.

Perl 6 - the future is here, just unevenly distributed
  • Comment on Re^4: Is it possible to find the number of matching and non-matching positions in strings using perl code?

In Section Seekers of Perl Wisdom