Problems? Is your data what you think it is? | |
PerlMonks |
Re^3: Why is this code so much slower than the same algorithm in C?by trwww (Priest) |
on Dec 09, 2008 at 05:20 UTC ( [id://729090]=note: print w/replies, xml ) | Need Help?? |
Apples to oranges...
Well the script is a constant because all three perl binaries can run it unmodified. Actually, I found 5.6 runs much faster (not surprising, it is a much slimmer app). The top run is using a system provided 5.8, and the second run is a 5.6 install I have for an app I maintain:
I ran it a few times and the figures were about the same. But I agree, not really useful. It is a bit interesting though. Regards,
In Section
Seekers of Perl Wisdom
|
|