@@ -16,13 +16,13 @@ public void testFactorizationOfEvenNumber() {
1616
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 ];
2222
2323 assertEquals (number , p .multiply (q ), "Factors should multiply to the original number." );
2424 }
25-
25+
2626 @ Test
2727 public void testFactorizationOfPrimeNumber () {
2828 ShorAlgorithm shor = new ShorAlgorithm ();
@@ -31,13 +31,13 @@ public void testFactorizationOfPrimeNumber() {
3131
3232 assertNull (factors , "Factors should be null for prime numbers." );
3333 }
34-
34+
3535 @ Test
3636 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." );
4343
@@ -46,5 +46,4 @@ public void testFactorizationOfEvenCompositeNumber() {
4646
4747 assertEquals (number , p .multiply (q ), "Factors should multiply to the original number." );
4848 }
49- }
50-
49+ }
0 commit comments