Skip to content

A python function for finding prime numbers using the Sieve of Eratosthenes algorithm

Notifications You must be signed in to change notification settings

nathanjcochran/sieve_of_eratosthenes

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 

Repository files navigation

sieve of eratosthenes

A python function for finding prime numbers using the Sieve of Eratosthenes algorithm. This version does not include even numbers in the list of possible primes, cutting memory usage by a factor of 2.

This function can successfully find all primes less than 100,000,000.

About

A python function for finding prime numbers using the Sieve of Eratosthenes algorithm

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages