Re: Re: Re: Re: (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.	[reply]