Beefy Boxes and Bandwidth Generously Provided by pair Networks
"be consistent"
 
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?
[ambrus]: erix: further, SQLite may be the second most installed piece of software on earth after zlib.
[erix]: heh, really? yeah, I suppose it may be so
[ambrus]: We're not really sure. There are some other contenders like libjpeg, and it's not easy to tell how you even measure this.

How do I use this? | Other CB clients
Other Users?
Others exploiting the Monastery: (10)
As of 2017-09-25 14:17 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    During the recent solar eclipse, I:









    Results (280 votes). Check out past polls.

    Notices?