Generate all primes below 100.

PROCEDURE:- 
         
      1.set n=1
      2. repeat steps 3 to 6 until n reaches 100
      3.start finding modulo value for  n with i=2 to n-1 value incrementing i by 1 each time
      4.if at  any point remainder becomes 0
      5.don’t print that n
      5.else print n
      6.increment  n by 1

CODE:-

#include<stdio.h>
void main()
{
int  i,flag,n ;
printf(“primes below 100 are\n”);
for(n=1;n<=100;n++)
{
   flag=0;
   for(i=2;i<n;i++)
      {
          if (n % i = = 0)
            {
             flag=1;
            break;
             }
        }
    if (flag = = 0)
    printf(“%3d “,n);
  }
}


Output:-1,2,3,5,7,11,13,17,19,23,………………97