isPrime function

bool isPrime(
  1. int number
)

Implementation

bool isPrime(int number) {
  if (number <= 1) {
    return false; // 0 and 1 are not prime numbers
  }
  for (int i = 2; i <= number / 2; i++) {
    if (number % i == 0) {
      return false; // If the number is divisible by any number other than 1 and itself, it's not prime
    }
  }
  return true; // If the number is not divisible by any number other than 1 and itself, it's prime
}