Beefy Boxes and Bandwidth Generously Provided by pair Networks
Just another Perl shrine
 
PerlMonks  

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

by chipmunk (Parson)
on May 19, 2001 at 22:00 UTC ( #81743=note: print w/replies, xml ) Need Help??


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

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!

  • Comment on Re: Re: Re: Re: (Golf): Sieve of Eratosthenes

Replies are listed 'Best First'.
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.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://81743]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others musing on the Monastery: (10)
As of 2016-08-30 13:50 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    The best thing I ever won in a lottery was:















    Results (418 votes). Check out past polls.