Add PrimeCheck algorithm in Java

Author: manikonda-anjali

add-primecheck-algorithm

@@ -0,0 +1,19 @@
+package com.thealgorithms.math;
+
+public class PrimeCheck {
+    public static boolean isPrime(int n) {
+        if (n <= 1) return false;
+        for (int i = 2; i <= Math.sqrt(n); i++) {
+            if (n % i == 0) return false;
+        }
+        return true;
+    }
+
+    public static void main(String[] args) {
+        int num = 7;
+        if (isPrime(num))
+            System.out.println(num + " is a prime number.");
+        else
+            System.out.println(num + " is not a prime number.");
+    }
+}