java-coding-problems/src/PrimeNumberCheck.java at main · jfullstackdev/java-coding-problems · GitHub

30 lines (24 loc) · 483 Bytes

public class PrimeNumberCheck {

public static void main(String[] args) {

int n;

n = 12;

System.out.print("is ");

System.out.print(n);

System.out.print(" prime number ? ");

System.out.println(isPrime(n));

}

public static boolean isPrime(int n) {

if (n == 0 || n == 1) {

return false;

}

if (n == 2) {

return true;

}

for (int i = 2; i <= n / 2; i++) {

if (n % i == 0) {

return false;

}

return true;

}

Expand file tree