Updated 09-16-2017
The Sieve of Eratosthenes algorithm implemented in free-form Fortran 95. Finds all primes below input n, returns largest prime as output. More information.
Input: 1000
Output: 997
rstreet85/ERATOS-FORTRAN
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|