Write an Algorithm and a program to check the given number is prime or not.
Algorithm -
Step (1):- Start
Step (2):- Declare the variable n, i =2 as integer type
Step (3):- Read the value of n
Step (4):- while ( i < = n - 1 )
(4.1) if (n%i= = 0)
(4.2) Write “not a prime number”
(4.3) break
(4.4) i is increment by 1
(4.5) end of the while loop
Step (5):- if (i= = n)
(5.1) Write “prime number”
Step (6):- Stop
Program:-
#include<stdio.h>
#include<conio.h>
void main()
{
clrscr();
int n, i=2;
printf("Enter a number");
scanf("%d",&n);
while(i<=n-1)
{
if(n%i==0)
{
printf("not a prime no");
break;
}
i++;
}
if(i==n)
printf("prime number");
getch();
}
Output:-
Enter a number
7
prime number
Algorithm -
Step (1):- Start
Step (2):- Declare the variable n, i =2 as integer type
Step (3):- Read the value of n
Step (4):- while ( i < = n - 1 )
(4.1) if (n%i= = 0)
(4.2) Write “not a prime number”
(4.3) break
(4.4) i is increment by 1
(4.5) end of the while loop
Step (5):- if (i= = n)
(5.1) Write “prime number”
Step (6):- Stop
Program:-
#include<stdio.h>
#include<conio.h>
void main()
{
clrscr();
int n, i=2;
printf("Enter a number");
scanf("%d",&n);
while(i<=n-1)
{
if(n%i==0)
{
printf("not a prime no");
break;
}
i++;
}
if(i==n)
printf("prime number");
getch();
}
Output:-
Enter a number
7
prime number
0 Comments:
Post a Comment