Question

Implement THIS algorithm of the sieve of Eratosthenes

Answer 1

Since you have not mentioned the language of your preference, I am providing the code in JAVA.

CODE

import java.util.Scanner;

class SieveOfEratosthenes

{

public static void findPrimesUsingSieveOfEratosthenes(int n)

{

boolean prime[] = new boolean[n+1];

for(int i=0;i<n;i++)

prime[i] = true;

for(int p = 2; p*p <=n; p++)

{

if(prime[p] == true)

{

for(int i = p*p; i <= n; i += p)

prime[i] = false;

}

}

for(int i = 2; i <= n; i++)

{

if(prime[i] == true)

System.out.print(i + " ");

}

}

public static void main(String args[])

{

int n;

Scanner sc = new Scanner(System.in);

System.out.println("Enter the value of n : ");

n = sc.nextInt();

System.out.println("Prime numbers upto " + n + " are given below: ");

findPrimesUsingSieveOfEratosthenes(n);

}

}