It's probably 90% as fast as C for string analysis and list building... But compare their function call stacks once. Then it's only about 1% as fast as C.
This is not a good way to do fib, but it does illustrate my point:
use strict; for my $i (0 .. 35) { print "i=$i ... fib(i)=", &fib($i), "\n"; } sub fib { my $n = shift; return &fib($n-1) + &fib($n-2) if $n>1; return 1; }
versus
int fib(int n) { if( n > 1 ) return fib(n-1) + fib(n-2); return 1; } int main() { int i; for(i=0; i<36; i++) printf("i=%d ... fib(i)=%d\n", i, fib(i)); return 0; }
-Paul
In reply to Re^2: FASTER PERL (velocigen velometer mod perl or Perl Server Pages)
by jettero
in thread FASTER PERL (velocigen velometer mod perl or Perl Server Pages)
by virtualweb
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |