GitHunt

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

eratos3.py

Python 3 script

Languages

Python100.0%
Created September 17, 2017
Updated September 17, 2017