
Untitled
By: a guest on
May 31st, 2012 | syntax:
None | size: 0.89 KB | hits: 10 | expires: Never
explain this prime number program [C]
#include<stdio.h>
main()
{
int n;
int a,b,flag=1;
scanf("%d",&n);
for(a=2; a<=n; a++)
{
if(n % a == 0)
{
printf("not prime");
flag = 0;
break;
}
}
if(flag == 1)
{
printf("is prime");
}
getch();
}
for(a=2; a<=n; a++)
#include<stdio.h>
main()
{
int i, num, flag = 1;
scanf("%d",&num);
for(i=2; i<=sqrt(num); i++)
{
if(num%i==0)
{
printf("not prime");
flag=0;
break;
}
}
if(flag==1)
{
printf("is prime");
}
getch();
}
for(i=2; i<=sqrt(num); i++)
for(a=2; a<=n; a++)
for(a=2; a<n; a++)
for(a=2; a <= n; a++)
for(a=2; a < n; a++)
//^ difference
int m = sqrt(n); //store the result in int type
for(a=2; a <= m ; a++)