Tag Archives: prime numbers
How Fast (or Slow) Is Perl 6?
In my previous post, I created a short, simple, sweet, and très élégant Perl 6 function to find all the primes up to a given maximum. Unfortunately, Rakudo spent over 11 seconds to find the 168 primes up to 1000. … Continue reading
Perl 6 and the Price of Elegant Code
The project that first made me fall in love with Perl… Perl 5 had recently launched, with new features for object-oriented programming, includable modules, lexically scoped variables, and references—including closures. At the time, I was writing boot code, diagnostics, and … Continue reading