Handled Clang and Build

Author: joelkurien

src/main/java/com/thealgorithms/others/ShorAlgorithm.java

@@ -3,7 +3,7 @@
 import java.math.BigInteger;
 import java.util.Random;
 
-// The algorithm is referred from 
+// The algorithm is referred from
 // https://www.geeksforgeeks.org/shors-factorization-algorithm/
 public class ShorAlgorithm {
     // trying to find the order of exponent given the base and the number
@@ -37,15 +37,21 @@ public BigInteger[] shorAlgorithm(BigInteger number) {
         }
 
         int result = exponent(base, number);
-        if (result % 2 != 0) return null;
+        if (result % 2 != 0) {
+            return null;
+        }
 
         BigInteger congruentResult = base.modPow(BigInteger.valueOf(result / 2), number);
-        if (congruentResult.equals(number.subtract(BigInteger.ONE))) return null;
+        if (congruentResult.equals(number.subtract(BigInteger.ONE))) {
+            return null;
+        }
 
         BigInteger p = congruentResult.add(BigInteger.ONE).gcd(number);
         BigInteger q = congruentResult.subtract(BigInteger.ONE).gcd(number);
 
-        if (!p.equals(BigInteger.ONE) && !q.equals(BigInteger.ONE)) return new BigInteger[] {p, q};
+        if (!p.equals(BigInteger.ONE) && !q.equals(BigInteger.ONE)) {
+            return new BigInteger[] {p, q};
+        }
         return null;
     }
 }

src/test/java/com/thealgorithms/others/ShorAlgorithmTest.java

@@ -2,7 +2,9 @@
 
 import java.math.BigInteger;
 import org.junit.jupiter.api.Test;
-import static org.junit.jupiter.api.Assertions.*;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertNull;
 
 public class ShorAlgorithmTest {