Your skill will accomplish what the force of many cannot |
|
PerlMonks |
RE: Algorithm Efficiency vs. Specialized Hardware?by Russ (Deacon) |
on Jun 20, 2000 at 11:42 UTC ( [id://18945]=note: print w/replies, xml ) | Need Help?? |
P.S. to the above post: grep should be slower than the other
two algorithms. Aighearach's
results were predictable,
where mine are distinctly opposite... Update: Having seen a few posts, I have to "update my version of reality" (as a friend always chides me for doing slowly). The grep sort implementation is running faster on everyone else's machines, too. Algorithm analysis would conclude that since sort is in O(N log N), it should be slower than an O(N) algorithm (Max and Ternary should both be in O(N)). Real-world results don't show this. What's going on? Somebody help me update my version of reality! :-) Here is what happens on my system: It is a dual PPro 200 (180, overclocked), RedHat 5.2 (seriously upgraded - 2.2.12 kernel). perl -v says:
In Section
Seekers of Perl Wisdom
|
|