code for BAEL-747 after incorporating review comments (#1560)

algorithms/src/main/java/com/baeldung/algorithms/primechecker/BigIntegerPrimeChecker.java

@@ -0,0 +1,13 @@
+package com.baeldung.algorithms.primechecker;
+
+import java.math.BigInteger;
+
+public class BigIntegerPrimeChecker implements PrimeChecker{
+
+    @Override
+    public boolean isPrime(int number) {
+        BigInteger bigInt = BigInteger.valueOf(number);
+        return bigInt.isProbablePrime(100);
+    }
+
+}

algorithms/src/main/java/com/baeldung/algorithms/primechecker/BruteForcePrimeChecker.java

@@ -0,0 +1,13 @@
+package com.baeldung.algorithms.primechecker;
+
+import java.util.stream.IntStream;
+
+public class BruteForcePrimeChecker implements PrimeChecker{
+
+    @Override
+    public boolean isPrime(int number) {
+        return IntStream.range(2, number).noneMatch(n -> (number % n == 0));
+    }
+
+    
+}       

algorithms/src/main/java/com/baeldung/algorithms/primechecker/OptimisedPrimeChecker.java

@@ -0,0 +1,14 @@
+package com.baeldung.algorithms.primechecker;
+
+import java.util.stream.IntStream;
+
+public class OptimisedPrimeChecker implements PrimeChecker{
+
+    @Override
+    public boolean isPrime(int number) {
+        return IntStream.range(2, (int)Math.sqrt(number) + 1)
+            .noneMatch(n -> (number % n == 0));
+    }
+
+    
+}

algorithms/src/main/java/com/baeldung/algorithms/primechecker/PrimeChecker.java

@@ -0,0 +1,6 @@
+package com.baeldung.algorithms.primechecker;
+
+public interface PrimeChecker {
+    
+    public boolean isPrime( int number );
+}

algorithms/src/main/java/com/baeldung/algorithms/primechecker/PrimesPrimeChecker.java

@@ -0,0 +1,12 @@
+package com.baeldung.algorithms.primechecker;
+
+import org.apache.commons.math3.primes.Primes;
+
+public class PrimesPrimeChecker implements PrimeChecker{
+
+    @Override
+    public boolean isPrime(int number) {
+        return Primes.isPrime(number);
+    }
+
+}