Skip to content
master
Go to file
Code

Latest commit

 

Git stats

Files

Permalink
Failed to load latest commit information.
Type
Name
Latest commit message
Commit time
 
 
 
 

README.md

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

Releases

No releases published

Packages

No packages published

Languages