How to print the first 100 prime numbers in C

1 Answer

0 votes
#include <stdio.h>
#include <stdbool.h>

/*
    Determine whether a number is prime.

    The function uses a straightforward and efficient approach:
    - Reject numbers below 2.
    - Only test divisors up to the square root of n.
      Instead of calling sqrt(), we compare i*i <= n
      to avoid unnecessary floating‑point work.
*/
bool is_prime(int n) {
    if (n < 2) {
        return false;
    }

    for (int i = 2; i * i <= n; i++) {
        if (n % i == 0) {
            return false;   // Found a divisor → not prime
        }
    }

    return true;            // No divisors found → prime
}

/*
    Fill an array with the first `count` prime numbers.

    The caller provides:
    - `primes`: an integer array with enough space
    - `count`: how many primes to generate

    The function increments through natural numbers,
    checks primality, and stores primes until the array is full.
*/
void first_n_primes(int primes[], int count) {
    int number = 2;   // Start from the first prime candidate
    int index = 0;

    while (index < count) {
        if (is_prime(number)) {
            primes[index++] = number;
        }
        number++;
    }
}

int main(void) {
    /*
        Compute and print the first 100 prime numbers.
        Each prime is printed on its own line.
    */
    int primes[100];
    first_n_primes(primes, 100);

    for (int i = 0; i < 100; i++) {
        printf("%d\n", primes[i]);
    }

    return 0;
}


/*
run:

2
3
5
7
11
13
17
19
23
29
31
37
41
43
47
53
59
61
67
71
73
79
83
89
97
101
103
107
109
113
127
131
137
139
149
151
157
163
167
173
179
181
191
193
197
199
211
223
227
229
233
239
241
251
257
263
269
271
277
281
283
293
307
311
313
317
331
337
347
349
353
359
367
373
379
383
389
397
401
409
419
421
431
433
439
443
449
457
461
463
467
479
487
491
499
503
509
521
523
541

*/

 



answered Aug 9, 2021 by avibootz
edited Aug 18 by avibootz
...