ANN: Pyrex - a language for writing Python extension modules

[Chris Reay]

>>
>> Not to criticise your project, but this is not a good example to use -- 
>> you've started with a very unnecessarily slow algorithm.  For finding 
>> prime numbers, the Sieve of Eratosthenes is much better.  See e.g.
>> <http://aspn.activestate.com/ASPN/Cookbook/Python/Recipe/117119> which I 
>> implemented using simple generators so you don't need the kmax parameter.
>> 
>> -- 
>> David Eppstein       UC Irvine Dept. of Information & Computer Science

Are you kidding, David? That is "very unnecessarily" (sic) banal.