Question d’entretien chez Fast Enterprises
Write a function that determines if a number is prime and optimize it
Réponse à la question d'entretien
Utilisateur anonyme
29 oct. 2015
void isPrime(int someNumber) { if(someNumber % 2 == 0) return false; // if the number is divisible by 2 it is not prime for( int i = 3; i^2 < someNumber; i+2) { if(someNumber % i == 0) return false; // if the number is divisible by any odd number it is not prime } return true; }