Re: Perl Golf: was mail log filtering

["Tim Hart" <codermsu@earthlink.net>]

If it were to pass over an N line file N times it would be O(N) and not
O(N^2).
Right?

Pass me a test log and we'll benchmark yours, steves and mine against it.
(my quick hack to come..)

Tim Hart

<snip>
> Here's my explanation: Steve's algorithm is slow because it operates in
O(N^2)
> time. It passes over an N line file N times.
<snip>



-
To unsubscribe, send email to majordomo@silug.org with
"unsubscribe silug-discuss" in the body.