in reply to Knuth-Morris-Pratt Vs. Perl

I seem to have read somewhere that Perl uses the Boyer-Moore alorithm to do string searching rather than Knuth-Morris-Pratt.

Update: A nice site comparing both algorithms.

CountZero

A program should be light and agile, its subroutines connected like a string of pearls. The spirit and intent of the program should be retained throughout. There should be neither too little or too much, neither needless loops nor useless variables, neither lack of structure nor overwhelming rigidity." - The Tao of Programming, 4.1 - Geoffrey James

In Section Seekers of Perl Wisdom