For a couple of days, I’ve gathered a lot of information about prime numbers and algorithms which generates them. out of all the available algorithms, “Sieve of Eratosthenes” is one of the most normally used ones and i want to implement this algorithm in python. After an hour of battle with the Python, i successfully tamed it. The scriptgenerates all the prime numbers within the range of 2 and the number scanned from the user. The script will be available at http://rapidshare.com/files/411537514/eratosthenes.py.html
(image from wikipedia)
Advertisement
Really gud diagrammatic representation of the algo!!
Great work! Now attempt the Atkin’s sieve. It isn’t as complex as it may seem initially, and will give your CPU good stuff to savor.
very good work.. keep it up..