Java solution is not the fastest


#1

My code is faster than the fastest Java solution
public int isPrime(int A) {
if(A<2 || A > 2 && A%2 == 0) return 0;
for(int i = 3; i <= Math.sqrt(A); i+=2){
if(A%i == 0)return 0;
}
return 1;
}