Skip to content

C++ implementation of the Sieve of Eratosthenes algorithm

Notifications You must be signed in to change notification settings

rstreet85/EratosPlusPlus

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 

Repository files navigation

Sieve of Eratosthenes

Updated 09-16-2017

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

Input: 1000 Output: 997

Releases

No releases published

Packages

No packages published

Languages