Re: Re: (Golf): Sieve of Eratosthenes

I think that undef is not prime. :)

But at 47 characters I think MeowChow still won't be beat:

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

Comment on Re: Re: (Golf): Sieve of Eratosthenes Select or Download Code

Replies are listed 'Best First'.
Re: Re: Re: (Golf): Sieve of Eratosthenes by MeowChow (Vicar) on May 19, 2001 at 21:56 UTC
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	[reply] [d/l]
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]
Re (tilly) 5: (Golf): Sieve of Eratosthenes by tilly (Archbishop) on May 19, 2001 at 22:32 UTC
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]
Re: Re: Re: (Golf): Sieve of Eratosthenes by MeowChow (Vicar) on May 20, 2001 at 02:21 UTC
Abusing the rules for fun and profit (46 chars): `sub sieve { sub p{$_[0],@_>1?p(grep$_%$_[0],@_):1}p 2..pop }` [download] MeowChow s aamecha.s a..a\u$&owag.print	[reply] [d/l]