<p>我知道下面的方法不是生成素数列表的最快方法,但是在google上写下这个程序之前,我给自己提出了这个问题。它适用于数字约44000,但在我的2Ghz Core 2 Duo Macbook上运行时会出现分段错误。我现在对其他方法不感兴趣,但我对为什么它会给我一个seg错误感兴趣。在</p>
<p>在42751之前计算出最后一个断层。在</p>
<pre><code>from sys import argv, exit, setrecursionlimit
def isPrime(no, halfNo, x = 3):
# if counted through and all numbers from 3 too x are not factors is prime
if x > halfNo:
print no
return 1
# is x a factor?
if no % x == 0:
return 0
else:
isPrime(no, halfNo, x + 2)
path, limLow, limHigh = argv
limLow = int(limLow)
limHigh = int(limHigh)
setrecursionlimit(limHigh)
# negitive numbers, 0 and 1 are not primes so answer invalid
if limLow < 2:
exit('Invalid input');
# if lower limit is even its not prime so increase by 1
if limLow % 2 == 0:
limLow += 1
while (limLow <= limHigh):
isPrime(limLow, limLow / 2)
limLow += 2
</code></pre>