I'm trying to do this :
- The User chooses one number
- The program calls the
isaPrime()
function so we see if number is prime or not.
I wanted to do a loop so every time the number is not a prime, the user has to choose a new value.
Here's the code:
#include <iostream>
#include <math.h>
using namespace std;
bool isPrime (int num)
{
if (num <=1)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false;
else
{
bool prime = true;
int divisor = 3;
double num_d = static_cast<double>(num);
int upperLimit = static_cast<int>(sqrt(num_d) +1);
while (divisor <= upperLimit)
{
if (num % divisor == 0)
prime = false;
divisor +=2;
}
return prime;
}
}
int main()
{
int p;
do {
cout << "p : ";
cin >> p;
isPrime(p);
} while (isPrime(p));
}