Question

develop an algorithm to check whether a number is prime number or not​

Answer 1

Answer:

Program to Check Prime Number.

Enter a positive integer: 29 29 is a prime number. In the program, a for loop is iterated from i = 2 to i < n/2 . If n is perfectly divisible by i , n is not a prime number. ... After the loop, if n is a prime number, flag will still be 0.

Answer 2

Usɪɴɢ ғᴏʀ ʟᴏᴏᴘ:-

bool IsPrime(int number)

{

int root = sqrt(number) ;

for(int i=2; i<=root; i++)

{

if(number%i == 0)

return false;

}

return true;

}