mirror of
https://bitbucket.org/Mattrixwv/javaclasses.git
synced 2025-12-06 15:03:58 -05:00
Added new test for isPrime
This commit is contained in:
@@ -93,38 +93,53 @@ public class TestAlgorithms{
|
|||||||
correctAnswer = false;
|
correctAnswer = false;
|
||||||
answer = Algorithms.isPrime(num);
|
answer = Algorithms.isPrime(num);
|
||||||
assertEquals("isPrime Integer 3 failed", correctAnswer, answer);
|
assertEquals("isPrime Integer 3 failed", correctAnswer, answer);
|
||||||
|
|
||||||
//Test 4
|
//Test 4
|
||||||
|
num = 1;
|
||||||
|
correctAnswer = false;
|
||||||
|
answer = Algorithms.isPrime(num);
|
||||||
|
assertEquals("isPrime Integer 4 failed", correctAnswer, answer);
|
||||||
|
|
||||||
|
//Test 5
|
||||||
long longNum = 2;
|
long longNum = 2;
|
||||||
correctAnswer = true;
|
correctAnswer = true;
|
||||||
answer = Algorithms.isPrime(longNum);
|
answer = Algorithms.isPrime(longNum);
|
||||||
assertEquals("isPrime Long 1 failed", correctAnswer, answer);
|
assertEquals("isPrime Long 1 failed", correctAnswer, answer);
|
||||||
//Test 5
|
//Test 6
|
||||||
longNum = 97;
|
longNum = 97;
|
||||||
correctAnswer = true;
|
correctAnswer = true;
|
||||||
answer = Algorithms.isPrime(longNum);
|
answer = Algorithms.isPrime(longNum);
|
||||||
assertEquals("isPrime Long 2 failed", correctAnswer, answer);
|
assertEquals("isPrime Long 2 failed", correctAnswer, answer);
|
||||||
//Test 6
|
//Test 7
|
||||||
longNum = 1000;
|
longNum = 1000;
|
||||||
correctAnswer = false;
|
correctAnswer = false;
|
||||||
answer = Algorithms.isPrime(longNum);
|
answer = Algorithms.isPrime(longNum);
|
||||||
assertEquals("isPrime Long 3 failed", correctAnswer, answer);
|
assertEquals("isPrime Long 3 failed", correctAnswer, answer);
|
||||||
|
//Test 8
|
||||||
|
longNum = 1;
|
||||||
|
correctAnswer = false;
|
||||||
|
answer = Algorithms.isPrime(longNum);
|
||||||
|
assertEquals("isPrime Long 4 failed", correctAnswer, answer);
|
||||||
|
|
||||||
//Test 7
|
//Test 9
|
||||||
BigInteger bigNum = BigInteger.TWO;
|
BigInteger bigNum = BigInteger.TWO;
|
||||||
correctAnswer = true;
|
correctAnswer = true;
|
||||||
answer = Algorithms.isPrime(bigNum);
|
answer = Algorithms.isPrime(bigNum);
|
||||||
assertEquals("isPrime BigInteger 1 failed", correctAnswer, answer);
|
assertEquals("isPrime BigInteger 1 failed", correctAnswer, answer);
|
||||||
//Test 8
|
//Test 10
|
||||||
bigNum = BigInteger.valueOf(97);
|
bigNum = BigInteger.valueOf(97);
|
||||||
correctAnswer = true;
|
correctAnswer = true;
|
||||||
answer = Algorithms.isPrime(bigNum);
|
answer = Algorithms.isPrime(bigNum);
|
||||||
assertEquals("isPrime BigInteger 2 failed", correctAnswer, answer);
|
assertEquals("isPrime BigInteger 2 failed", correctAnswer, answer);
|
||||||
//Test 9
|
//Test 11
|
||||||
bigNum = BigInteger.valueOf(1000);
|
bigNum = BigInteger.valueOf(1000);
|
||||||
correctAnswer = false;
|
correctAnswer = false;
|
||||||
answer = Algorithms.isPrime(bigNum);
|
answer = Algorithms.isPrime(bigNum);
|
||||||
assertEquals("isPrime BigInteger 3 failed", correctAnswer, answer);
|
assertEquals("isPrime BigInteger 3 failed", correctAnswer, answer);
|
||||||
|
//Test 12
|
||||||
|
bigNum = BigInteger.ONE;
|
||||||
|
correctAnswer = false;
|
||||||
|
answer = Algorithms.isPrime(bigNum);
|
||||||
|
assertEquals("isPrime BigInteger 4 failed", correctAnswer, answer);
|
||||||
}
|
}
|
||||||
@Test
|
@Test
|
||||||
public void testGetFactors() throws InvalidResult{
|
public void testGetFactors() throws InvalidResult{
|
||||||
|
|||||||
Reference in New Issue
Block a user