Speaking of algorithmic efficiency. Consider the case where $string[17] eq "x" and preceding values all span kilobytes. Clearly, there's some room for improvement.
In reply to Re^2: An efficient way to gather a common portion of several strings' beginnings
by Anonymous Monk
in thread An efficient way to gather a common portion of several strings' beginnings
by igoryonya
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |