New submission from ttsiod <ttsiod...@gmail.com>: 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). ---------- components: None files: sieve.py messages: 97109 nosy: ttsiod severity: normal status: open title: Python 2.6.4 segfaults type: crash versions: Python 2.6 Added file: http://bugs.python.org/file15714/sieve.py _______________________________________ Python tracker <rep...@bugs.python.org> <http://bugs.python.org/issue7614> _______________________________________ _______________________________________________ Python-bugs-list mailing list Unsubscribe: http://mail.python.org/mailman/options/python-bugs-list/archive%40mail-archive.com
