check_if_prime function
Implementation
String check_if_prime(int number) {
if (number == 1) {
return ("neither a prime nor composite number");
}
bool flag = true;
for (int i = 2; i < number; i++) {
if (number % i == 0) {
flag = false;
break;
}
}
if (flag) {
return ("a prime number!");
}
else {
return ("not a prime number!");
}
}