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

for p 2 to n do A[p] p for p 2 to Lyij do /see note before pseudocode //p hasn't been eliminated on previous passes while j