Comments on: Round two of golf http://blag.tsukasa.net.au/2008/08/22/round-two-of-golf/ Tech ramblings of Greg Darke, a University of Sydney student Tue, 06 Jan 2009 20:09:40 +0000 http://wordpress.org/?v=2.6.5 By: Tsukasa http://blag.tsukasa.net.au/2008/08/22/round-two-of-golf/#comment-6 Tsukasa Sat, 23 Aug 2008 16:45:24 +0000 http://blag.tsukasa.net.au/2008/08/22/round-two-of-golf/#comment-6 James: Although that is a nice solution, it is not exactly a prime sieve... It requires the use of the modulus operator (which the prime sieve alleviates). Though, due to how python is implemented, your method might still be faster (though it does suffer from the recursion problem. James: Although that is a nice solution, it is not exactly a prime sieve… It requires the use of the modulus operator (which the prime sieve alleviates). Though, due to how python is implemented, your method might still be faster (though it does suffer from the recursion problem.

]]> By: James C http://blag.tsukasa.net.au/2008/08/22/round-two-of-golf/#comment-5 James C Sat, 23 Aug 2008 02:23:33 +0000 http://blag.tsukasa.net.au/2008/08/22/round-two-of-golf/#comment-5 72 characters: _=lambda x:x and x[:1]+_([i for i in x if i%x[0]]);print _(range(2,1e3)) I should point out though that there is a limit to how high you can go with this one before you hit Python's maximum recursion depth... It's also not one statement. 72 characters:

_=lambda x:x and x[:1]+_([i for i in x if i%x[0]]);print _(range(2,1e3))

I should point out though that there is a limit to how high you can go with this one before you hit Python’s maximum recursion depth…
It’s also not one statement.

]]> By: Tsukasa http://blag.tsukasa.net.au/2008/08/22/round-two-of-golf/#comment-4 Tsukasa Fri, 22 Aug 2008 11:46:25 +0000 http://blag.tsukasa.net.au/2008/08/22/round-two-of-golf/#comment-4 Don't forget that you are counting the newline character there... So your solution is actually 145 characters long... I am sorry to say though, I am down to 132 (after a trip on the bus). I have updated the main article to reflect my new solution. Don’t forget that you are counting the newline character there… So your solution is actually 145 characters long…

I am sorry to say though, I am down to 132 (after a trip on the bus).

I have updated the main article to reflect my new solution.

]]> By: Tim http://blag.tsukasa.net.au/2008/08/22/round-two-of-golf/#comment-3 Tim Fri, 22 Aug 2008 11:36:10 +0000 http://blag.tsukasa.net.au/2008/08/22/round-two-of-golf/#comment-3 Huzzah, tim@tim-imac:/tmp/ncss$ wc -c prime_* 146 prime_mine.py 153 prime_original.py tim@tim-imac:/tmp/ncss$ cat prime_mine.py print[n for(n,l)in[(((0,[]),(i,vars()['_[2]']))[i>1])for i in range(1e3)]if n and not l.__setitem__(slice(n*2,None,n),[(0,None)]*len(l[n*2::n]))] Huzzah,

tim@tim-imac:/tmp/ncss$ wc -c prime_*
146 prime_mine.py
153 prime_original.py

tim@tim-imac:/tmp/ncss$ cat prime_mine.py
print[n for(n,l)in[(((0,[]),(i,vars()['_[2]‘]))[i>1])for i in range(1e3)]if n and not l.__setitem__(slice(n*2,None,n),[(0,None)]*len(l[n*2::n]))]

]]>