Nice explanation++.
One minor change: s/binary operations are faster than looping over all characters/looping over the characters in C is faster than looping over the characters in Perl/
In reply to Re^2: Is it possible to find the number of matching and non-matching positions in strings using perl code?
by BrowserUk
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: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |