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
-
Notifications
You must be signed in to change notification settings - Fork 0
rstreet85/ERATOS-FORTRAN
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Fortran 95 implementation of the Sieve of Eratosthenes
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published