Here’s my prime number algorithm implementation that I have written in C#.
public static bool IsPrime(int x)
{
if (x <= 1)
return false;
else
{
double i = 2;
bool r = true;
while (i <= Math.Sqrt(x))
{
if ((x / i) % 1 == 0)
{
r = false;
break;
}
i++;
}
return r;
}
}
0 Responses to “Finding Prime Numbers”