Message97109
I found a nice yield-based implementation of the sieve of Eratosthenes.
I tried to find the last prime number less than 1.000.000 (1M) - so I
had to increase the recursion limit (via sys.setrecursionlimit).
It seemed to work - but after running for about 3 minutes, the
Python interpreter (2.6.4) crashed with a segmentation fault.
I am attaching the code - it uses no libraries except for "sys"
(it needs it to set the recursionlimit). |
|
Date |
User |
Action |
Args |
2009-12-31 21:33:14 | ttsiod | set | recipients:
+ ttsiod |
2009-12-31 21:33:14 | ttsiod | set | messageid: <1262295194.3.0.0100824369598.issue7614@psf.upfronthosting.co.za> |
2009-12-31 21:33:13 | ttsiod | link | issue7614 messages |
2009-12-31 21:33:12 | ttsiod | create | |
|