TCS• Prep

Prime Check

Here is the optimized solution in Java. Copy or view it below.

Java

package Problems_On_Number;

public class PrimeCheck {
    public static boolean isPrime(int N) {

        for (int i = 2; i < Math.sqrt(N); i++) {
            if (N % i == 0) {
                return false;
            }
        }
        return true;

    }

    public static void main(String args[]) {
        int n = 20;
        boolean ans = (isPrime(n));
        if (n != 1 && ans == true) {
            System.out.println("Prime Number");
        } else {
            System.out.println("Non Prime Number");
        }
    }
}