Sieve of Eratosthenes

Updated 09-16-2017

The Sieve of Eratosthenes algorithm implemented in Python. Finds all primes below input n, returns largest prime as output. More information.

Input: 1000 Output: 997

eratos2.x.py

Python 2 script

Python 3 script

Name		Name	Last commit message	Last commit date
Latest commit History 4 Commits
.gitignore		.gitignore
Readme.md		Readme.md
eratos2.x.py		eratos2.x.py
eratos3.py		eratos3.py