擅长:python、mysql、java
<p>看看这个相关的主题:
<a href="https://stackoverflow.com/questions/2068372/fastest-way-to-list-all-primes-below-n-in-python/18944432#18944432">Fastest way to list all primes below N</a>
在8*10^8以下的最快筛子是由@Robert William Hanks编码的rwh峎u prime1</p>
<pre><code>'''Robert William Hanks 2010'''
def primes1(n):
""" Returns a list of primes < n """
sieve = [True] * (n/2)
for i in xrange(3,int(n**0.5)+1,2):
if sieve[i/2]:
sieve[i*i/2::i] = [False] * ((n-i*i-1)/(2*i)+1)
return [2] + [2*i+1 for i in xrange(1,n/2) if sieve[i]]
</code></pre>