> P.P.S. Here are my results with the correct code. Grep is
    > still faster than the other algorithms, so the original
    > question still stands (how can Perl execute an O(N) plus
    > an O(N log N) algorithm faster than a single O(N)?)