Posted by soorya25 on Feb 07, 2023; 6:27am
URL: https://forum.world.st/Fwd-Sieve-of-Eratosthenes-tp56093p5131441.html

Hi, Below is the C++ implementation of the problem
Ref- Adaface

int checkPrime(int n) {
   if (n <= 1)
      return 0;

   for (int i = 2; i < n; i++)
      if (n % i == 0)
         return 0;

   return 1;
}

void Prime(int n) {
   for (int i = 2; i <= n; i++) {
      if (checkPrime(i))
         cout << i << " ";
   }
}