Skip to content

Prime Check (Function)

Encapsulate prime-checking logic in a reusable function.

package DSA.Functions;
import java.util.Scanner;
public class primeOrnot {
public static boolean prime(int n) {
if (n == 2 || n == 1) {
return true;
} else {
for (int i = 2; i <= Math.sqrt(n); i++) {
if (n % i == 0) {
return false;
}
}
}
return true;
}
public static void main(String[] args) {
try (Scanner sc = new Scanner(System.in)) {
System.out.println("Ente value of n :");
int n = sc.nextInt();
boolean p = prime(n);
if (p) {
System.out.println("Prime");
} else {
System.out.println("Not Prime");
}
} catch (Exception e) {
System.out.println(e);
}
}
}