jac@yoko.rutgers.edu (Jonathan A. Chandross) (12/02/90)
Submitted-by: NONE
Posting-number: Volume 1, Source:15
Archive-name: util/sieve
Architecture: ANY_2
Version-number: 1.00
No computer should be without a program to compute prime numbers.
Here's one.
Enjoy.
=primes.c
-/*
- *
- * sieve.c
- *
- * Eratosthenes Sieve Prime Number Program.
- *
- * Usage:
- * seive
- *
- * Contributed Anonymously. Written: November 1983
- *
- * Version 1.00
- *
- */
-
-#define TRUE 1
-#define FALSE 0
-#define SIZE 8190
-
-char flags[SIZE+1] ;
-
-main()
-{
- int i, prime, k, count, iter ;
-
- printf("10 iterations\n") ;
-
- for( iter=1 ; iter <= 10 ; iter++ ) {
- count = 0 ;
- for( i=0 ; i <= SIZE ; i++ )
- flags[i] = TRUE ;
- for( i=0 ; i<= SIZE ; i++ ) {
- if( flags[i] ) {
- prime = i + i + 3 ;
-/* printf("\n%d", prime ) ; */
- for( k=i+prime ; k <= SIZE ; k+=prime )
- flags[k] = FALSE ;
- count++ ;
- }
- }
- }
-
- printf("\n%d primes.\n", count ) ;
-
-} /* end main */
-
-
+ END OF ARCHIVE