http://www.perlmonks.org?node_id=81741


in reply to Re: Re: (Golf): Sieve of Eratosthenes
in thread (Golf): Sieve of Eratosthenes

I had thought of that, but assumed it would slide :)

Make that 46 by the way... 

sub sieve {
  sub p{$_[0],$#_?p(grep$_%$_[0],@_):()}p 2..pop
}

[download]
   MeowChow                                   
               s aamecha.s a..a\u$&owag.print

Replies are listed 'Best First'.
Re: Re: Re: Re: (Golf): Sieve of Eratosthenes
by chipmunk (Parson) on May 19, 2001 at 22:00 UTC
    I had thought of that, but that goes into deep recursion if you call sieve(1). :)

    Oh, but tilly says that you may assume $n is above a fixed number. Pooh!

[reply]
      No. I only say that for the bonus problem.

      The first problem is correct first, efficient afterwards. The second should express the efficient algorithm accurately, but I allow some boundary sloppiness.

[reply]

In Section Meditations