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.
In reply to Re^4: Is it possible to find the number of matching and non-matching positions in strings using perl code?
by moritz
in thread Is it possible to find the number of matching and non-matching positions in strings using perl code?
by supriyoch_2008
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |