On Tue, Feb 18, 2003 at 04:03:40AM -0800, Tupshin Harper wrote: > FYI...all three used the identical algorithm taken from the primes.pasm > example complete with labels and gotos(makes for very disconcerting perl > code). Startup times and printf times were not significant in any of the > cases(<5%).
This is, unfortunately, a rigged demo. Its code optimized for Parrot and then mechanically translated into Perl and C. The algorithm would have been the same if it, for example, used a loop in Perl instead of gotos. I don't know that its all that interesting to show that goto is slow in Perl. OTOH, goto should be fast in C, no? I'm going to tinker with those benchmarks again.
