http://sange.fi/~atehwa/cgi-bin/piki.cgi/ Recent changes in sieve of erastothenes in clean python http://sange.fi/~atehwa/cgi-bin/piki.cgi/sieve%20of%20erastothenes%20in%20clean%20python http://sange.fi/~atehwa/cgi-bin/piki.cgi/#1510917233 <p><ins>(nettipäiväkirja 17.11.2017) I tried to find a succinct implementation of Erastothenes' sieve using Python generators. I was astounded that it took more time to find a decent one than to write it. So, I'm contributing my version:</ins> <p><ins>{{{ from itertools import count</ins> <p><ins>def sieve(nums): p = next(nums) yield p yield from sieve(n for n in nums if n%p)</ins> <p><ins>def primes(): return sieve(count(2)) }}}</ins> <p><ins>The versions here (http://www.macdevcenter.com/pub/a/python/excerpt/pythonckbk_chap1/index 1.html?page=2) or here (https://stackoverflow.com/questions/2211990/how-to-implement-an-efficie nt-infinite-generator-of-prime-numbers-in-python) are IMNSHO much less representative.</ins> <p><ins>* [merkintä: 2017-11] * [atehwa] * [kategoria: päiväkirjamerkintä]</ins> Fri, 17 Nov 2017 11:13:53 +0000