fork download
  1. #!/usr/bin/perl
  2.  
  3. # Idiom #315 Memoization
  4.  
  5. use Memoize;
  6.  
  7. # Compute Fibonacci numbers
  8.  
  9. sub f {
  10. my $n = shift;
  11. return $n if $n < 2;
  12. f($n-1) + f($n-2);
  13. }
  14.  
  15. memoize('f');
  16.  
  17. print "\n\nFast implementation using CPAN Memoization\n";
  18. foreach my $n ( 1..10 ) {
  19. print ' ' . f( $n );
  20. }
  21.  
Success #stdin #stdout 0.02s 6484KB
stdin
Standard input is empty
stdout

Fast implementation using CPAN Memoization
 1 1 2 3 5 8 13 21 34 55