A FUNCTION TO FIND WHETHER A GIVEN NO. IS PRIME OR NOT
/*A FUNCTION TO FIND WHETHER A GIVEN NO. IS PRIME OR NOT */
#include<stdio.h>
int checkprimenumber(int n);
int main()
{
int n1, n2, i, flag;
clrscr();
printf("Enter two positive integers: ");
scanf("%d %d", &n1, &n2);
printf("prime numbers between %d and %d are : ",n1,n2);
for(i=n1+1; i<n2; ++i)
{
// i is a prime number, flag will be equal to 1
flag = checkprimenumber(i);
if(flag ==1)
printf("%d", i);
}
return 0;
}
// user-defined function to check prime number
int checkprimenumber(int n)
{
int j, flag=1;
for(j=2; j<=n/2; ++j)
{
if(n%j==0)
{
flag = 0;
break;
}
}
return flag;
}
Output :-
Subscribe to:
Post Comments
(
Atom
)
No comments :
Post a Comment