Skip to content

Instantly share code, notes, and snippets.

Embed
What would you like to do?
public static boolean isPrime(int n) {
if (n == 1) {
return false;
}
for (i=2; i<=n/2; i++) {
if (n % i == 0) {
return false;
}
}
return true;
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
You can’t perform that action at this time.