GitHunt
RS

rstreet85/SundaramF90

Fortran 95 implementation of the Sieve of Sundaram.

Sieve of Sundaram

Updated 09-16-2017

The Sieve of Sundaram algorithm implemented in free-form Fortran 95. Finds all primes below input n, returns largest prime as output. More information.

Input: 1000
Output: 997

Languages

Fortran78.9%Makefile21.1%
Created September 17, 2017
Updated September 17, 2017