public boolean isPrime(int n) {
if (n <= 1) { return false; }
int last = n / 2;
for(int prime = 2; prime <= last; prime++) {
if(n % prime == 0) {
return false;
}
}
return true;
}
Created
June 20, 2018 05:51
-
-
Save audrl1010/baa9ba87e031a88daaefbe7b66ec5413 to your computer and use it in GitHub Desktop.
소수 판별법
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment