Question: int IsPrime ( int n ) { for ( int i = 2 ; i < = n - 1 ; i + + )

int IsPrime(int n)
{
for (int i=2; i<=n-1 ; i++)
{
if ((n % i)==0)
return 0;
}
return 1;
}
why does this work

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!