Re: Re: Re: (Golf): Sieve of Eratosthenes


There's more than one way to do things
	PerlMonks

by MeowChow (Vicar)

on May 19, 2001 at 21:56 UTC ( [id://81741]=note: print w/replies, xml )

Need Help??

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

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

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]
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]

In Section Meditations

Domain Nodelet^?

Node Status^?

node history
Node Type: note [id://81741]
help

Chatterbox^?

How do I use this? • Last hour • Other CB clients

Other Users^?

Others making s'mores by the fire in the courtyard of the Monastery: (4)

As of 2024-04-25 16:33 GMT

Sections^?

Information^?

Find Nodes^?

Leftovers^?

Voting Booth^?

No recent polls found