@@ -13,13 +13,13 @@ public void testFactorizationOfEvenNumber() {
1313 ShorAlgorithm shor = new ShorAlgorithm ();
1414 BigInteger number = new BigInteger ("15" );
1515 BigInteger [] factors = shor .shorAlgorithm (number );
16-
16+
1717 assertNotNull (factors , "Factors should not be null for composite numbers." );
1818 assertEquals (2 , factors .length , "There should be two factors." );
19-
19+
2020 BigInteger p = factors [0 ];
2121 BigInteger q = factors [1 ];
22-
22+
2323 assertEquals (number , p .multiply (q ), "Factors should multiply to the original number." );
2424 }
2525
@@ -28,7 +28,7 @@ public void testFactorizationOfPrimeNumber() {
2828 ShorAlgorithm shor = new ShorAlgorithm ();
2929 BigInteger number = new BigInteger ("13" );
3030 BigInteger [] factors = shor .shorAlgorithm (number );
31-
31+
3232 assertNull (factors , "Factors should be null for prime numbers." );
3333 }
3434
@@ -37,13 +37,13 @@ public void testFactorizationOfEvenCompositeNumber() {
3737 ShorAlgorithm shor = new ShorAlgorithm ();
3838 BigInteger number = new BigInteger ("20" );
3939 BigInteger [] factors = shor .shorAlgorithm (number );
40-
40+
4141 assertNotNull (factors , "Factors should not be null for composite numbers." );
4242 assertEquals (2 , factors .length , "There should be two factors." );
43-
43+
4444 BigInteger p = factors [0 ];
4545 BigInteger q = factors [1 ];
46-
46+
4747 assertEquals (number , p .multiply (q ), "Factors should multiply to the original number." );
4848 }
4949}
0 commit comments