¡@

Home 

python Programming Glossary: sieveofatkin

Fastest way to list all primes below N in python

http://stackoverflow.com/questions/2068372/fastest-way-to-list-all-primes-below-n-in-python

ambi_sieve_plain rwh_primes rwh_primes1 rwh_primes2 sieveOfAtkin sieveOfEratosthenes sundaram3 sieve_wheel_30 ambi_sieve requires.. was the fastest tested. Method ms rwh_primes1 43.0 sieveOfAtkin 46.4 rwh_primes 57.4 sieve_wheel_30 63.0 rwh_primes2 67.8 sieveOfEratosthenes.. 97.4 sieveOfEratosthenes 178.0 ambi_sieve_plain 286.0 sieveOfAtkin 314.0 sundaram3 416.0 Of all the methods tested allowing numpy..