Write Sieve of Eratosthenes in C++ using this algorithm.

//Implements the sieve of Eratosthenes

//Input: A positive integer n > 1 //Output: Array L of all prime numbers less than or equal to n

Example of output:

Enter a number: 25

Prime numbers: 2, 3, 5, 7, 11, 13, 17, 19, 23

Transcribed Image Text:

for p 2 to n do A[p] p 2 to n do for if A[p] #0 - 0 j p*p while j n do A[j] +0 i jj + p //copy the remaining elements of A to array L of the primes for p 2 to n do if A[p] +0 L[i] for p 2 to n do A[p] p 2 to n do for if A[p] #0 - 0 j p*p while j n do A[j] +0 i jj + p //copy the remaining elements of A to array L of the primes for p 2 to n do if A[p] +0 L[i]