Sieve of Eratosthenes Find All Primes in DSA C - Build from Scratch

Sieve of Eratosthenes Find All Primes

📖 Scenario: You are helping a teacher prepare a list of prime numbers for a math class. The teacher wants to find all prime numbers up to a certain number using a fast method called the Sieve of Eratosthenes.

🎯 Goal: Build a program that finds and prints all prime numbers up to a given number using the Sieve of Eratosthenes method.

📋 What You'll Learn

Create an array to mark numbers as prime or not

Use a variable to store the maximum number to check

Implement the sieve algorithm to mark non-prime numbers

Print all prime numbers found

💡 Why This Matters

🌍 Real World

Finding prime numbers quickly is useful in cryptography, computer security, and math research.

💼 Career

Understanding prime number algorithms helps in software development roles involving security, algorithms, and performance optimization.

1

Create the array to mark primes

Create an integer array called is_prime of size 21 to mark numbers from 0 to 20. Initialize all elements to 1 except for index 0 and 1, which should be set to 0 because 0 and 1 are not prime.

DSA C

int is_prime[21];
// Your code here

Hint

Use a for loop from 0 to 20. Set is_prime[0] and is_prime[1] to 0, others to 1.

2

Set the maximum number to check

Create an integer variable called max_num and set it to 20. This will be the highest number we want to check for primes.

DSA C

int is_prime[21];

for (int i = 0; i <= 20; i++) {
    if (i == 0 || i == 1) {
        is_prime[i] = 0;
    } else {
        is_prime[i] = 1;
    }
}

// Your code here

Hint

Just create int max_num = 20;

3

Implement the sieve algorithm

Use a for loop with variable i from 2 while i * i <= max_num. Inside it, if is_prime[i] is 1, use another for loop with variable j starting from i * i to max_num, incrementing by i. Set is_prime[j] to 0 inside the inner loop to mark multiples as not prime.

DSA C

int is_prime[21];

for (int i = 0; i <= 20; i++) {
    if (i == 0 || i == 1) {
        is_prime[i] = 0;
    } else {
        is_prime[i] = 1;
    }
}

int max_num = 20;

// Your code here

Hint

Use nested loops: outer from 2 to sqrt(max_num), inner from i*i to max_num stepping by i.

4

Print all prime numbers

Use a for loop with variable i from 2 to max_num. Inside the loop, if is_prime[i] is 1, print i followed by a space. After the loop, print a newline character.

DSA C

int is_prime[21];

for (int i = 0; i <= 20; i++) {
    if (i == 0 || i == 1) {
        is_prime[i] = 0;
    } else {
        is_prime[i] = 1;
    }
}

int max_num = 20;

for (int i = 2; i * i <= max_num; i++) {
    if (is_prime[i] == 1) {
        for (int j = i * i; j <= max_num; j += i) {
            is_prime[j] = 0;
        }
    }
}

// Your code here

Hint

Print all numbers where is_prime[i] is 1, separated by spaces, then print a newline.

Practice

1. What is the main purpose of the Sieve of Eratosthenes algorithm?

easy

A. To sort an array of numbers

B. To find all prime numbers up to a given limit

C. To find the greatest common divisor of two numbers

D. To reverse a string

Solution

1. Step 1: Understand the algorithm's goal

   The Sieve of Eratosthenes is designed to identify prime numbers efficiently.

2. Step 2: Recognize the output

   It marks multiples of primes as non-prime to find all primes up to a limit.

3. Final Answer:

   To find all prime numbers up to a given limit -> Option B

4. Quick Check:

   Prime finding = B [OK]

Hint: Sieve marks multiples to find primes fast [OK]

Common Mistakes:

• Confusing prime finding with sorting
• Thinking it finds divisors or reverses strings
• Assuming it works for negative numbers

2. Which of the following is the correct way to initialize the sieve array in C for finding primes up to n?

easy

A. int sieve[n+1]; for(int i=0; i<=n; i++) sieve[i] = 1;

B. int sieve[n]; for(int i=1; i

C. int sieve[n+1]; for(int i=0; i<=n; i++) sieve[i] = 0; sieve[0] = sieve[1] = 1;

D. int sieve[n+1]; for(int i=0; i<=n; i++) sieve[i] = i;

Solution

1. Step 1: Understand sieve initialization

   The sieve array uses 1 to mark potential primes initially.

2. Step 2: Check array size and initialization

   Array size should be n+1 to include number n, and all set to 1 (true) initially.

3. Final Answer:

   int sieve[n+1]; for(int i=0; i<=n; i++) sieve[i] = 1; -> Option A

4. Quick Check:

   Initialize all to 1 for primes [OK]

Hint: Initialize all to 1 (true) for prime candidates [OK]

Common Mistakes:

• Using size n instead of n+1
• Initializing with zeros instead of ones
• Marking 0 and 1 as prime initially

3. What will be the output of the following C code snippet using Sieve of Eratosthenes to find primes up to 10?

int n = 10;
int sieve[11];
for(int i=0; i<=n; i++) sieve[i] = 1;
sieve[0] = sieve[1] = 0;
for(int i=2; i*i<=n; i++) {
  if(sieve[i]) {
    for(int j=i*i; j<=n; j+=i) sieve[j] = 0;
  }
}
for(int i=2; i<=n; i++) {
  if(sieve[i]) printf("%d ", i);
}

medium

A. 2 3 4 5 7

B. 1 2 3 5 7

C. 2 3 5 7 9

D. 2 3 5 7

Solution

1. Step 1: Initialize sieve and mark 0,1 as non-prime

   Array sieve marks 0 and 1 as 0 (not prime), others as 1 (prime candidate).

2. Step 2: Mark multiples of primes as non-prime

   For i=2, mark 4,6,8,10 as 0; for i=3, mark 9 as 0.

3. Step 3: Print all indices with sieve[i] = 1

   Primes are 2, 3, 5, 7 only.

4. Final Answer:

   2 3 5 7 -> Option D

5. Quick Check:

   Primes up to 10 = 2 3 5 7 [OK]

Hint: Mark multiples starting from i*i to avoid repeats [OK]

Common Mistakes:

• Printing 1 as prime
• Including non-primes like 4 or 9
• Starting marking multiples from i instead of i*i

4. Identify the error in this Sieve of Eratosthenes code snippet and choose the correct fix:

int n = 20;
int sieve[21];
for(int i=0; i<=n; i++) sieve[i] = 1;
sieve[0] = sieve[1] = 0;
for(int i=2; i<=n; i++) {
  if(sieve[i]) {
    for(int j=2*i; j<=n; j+=i) sieve[j] = 0;
  }
}

medium

A. Remove sieve[0] and sieve[1] assignments

B. Initialize sieve array with zeros instead of ones

C. Change outer loop condition to i*i <= n

D. Start inner loop from j = i instead of 2*i

Solution

1. Step 1: Analyze outer loop condition

   Outer loop runs from 2 to n, but it should run only up to sqrt(n) for efficiency.

2. Step 2: Understand inner loop start

   Inner loop correctly starts from 2*i, but starting from i*i is more optimal.

3. Step 3: Correct the outer loop condition

   Change outer loop to for(i=2; i*i<=n; i++) to avoid unnecessary iterations.

4. Final Answer:

   Change outer loop condition to i*i <= n -> Option C

5. Quick Check:

   Outer loop till sqrt(n) improves sieve [OK]

Hint: Outer loop runs only to sqrt(n) for marking multiples [OK]

Common Mistakes:

• Running outer loop till n wastes time
• Starting inner loop from 2*i instead of i*i (less efficient)
• Not marking 0 and 1 as non-prime

5. You want to find all prime numbers up to 50 using the Sieve of Eratosthenes. After running the sieve, how many numbers will remain marked as prime?

hard

A. 15

B. 16

C. 14

D. 13

Solution

1. Step 1: List primes up to 50

   Primes are: 2,3,5,7,11,13,17,19,23,29,31,37,41,43,47 (total 15).

2. Step 2: Count primes carefully

   Counting again: 2,3,5,7,11,13,17,19,23,29,31,37,41,43,47 = 15 primes.

3. Step 3: Check if 1 is counted

   1 is not prime, so total primes = 15.

4. Final Answer:

   15 -> Option A

5. Quick Check:

   Count primes up to 50 = 15 [OK]

Hint: Count known primes or use sieve output count [OK]

Common Mistakes:

• Including 1 as prime
• Miscounting primes between 40 and 50
• Forgetting to exclude non-primes