mirror of
https://bitbucket.org/Mattrixwv/javaclasses.git
synced 2025-12-07 07:23:57 -05:00
Added test for gcd and isPrime
This commit is contained in:
@@ -77,6 +77,56 @@ public class TestAlgorithms{
|
||||
assertEquals("getNumPrimes BigInteger failed", bigCorrectAnswer, bigAnswer);
|
||||
}
|
||||
@Test
|
||||
public void testIsPrime(){
|
||||
//Test 1
|
||||
int num = 2;
|
||||
boolean correctAnswer = true;
|
||||
boolean answer = Algorithms.isPrime(num);
|
||||
assertEquals("isPrime Integer 1 failed", correctAnswer, answer);
|
||||
//Test 2
|
||||
num = 97;
|
||||
correctAnswer = true;
|
||||
answer = Algorithms.isPrime(num);
|
||||
assertEquals("isPrime Integer 2 failed", correctAnswer, answer);
|
||||
//Test 3
|
||||
num = 1000;
|
||||
correctAnswer = false;
|
||||
answer = Algorithms.isPrime(num);
|
||||
assertEquals("isPrime Integer 3 failed", correctAnswer, answer);
|
||||
|
||||
//Test 4
|
||||
long longNum = 2;
|
||||
correctAnswer = true;
|
||||
answer = Algorithms.isPrime(longNum);
|
||||
assertEquals("isPrime Long 1 failed", correctAnswer, answer);
|
||||
//Test 5
|
||||
longNum = 97;
|
||||
correctAnswer = true;
|
||||
answer = Algorithms.isPrime(longNum);
|
||||
assertEquals("isPrime Long 2 failed", correctAnswer, answer);
|
||||
//Test 6
|
||||
longNum = 1000;
|
||||
correctAnswer = false;
|
||||
answer = Algorithms.isPrime(longNum);
|
||||
assertEquals("isPrime Long 3 failed", correctAnswer, answer);
|
||||
|
||||
//Test 7
|
||||
BigInteger bigNum = BigInteger.TWO;
|
||||
correctAnswer = true;
|
||||
answer = Algorithms.isPrime(bigNum);
|
||||
assertEquals("isPrime BigInteger 1 failed", correctAnswer, answer);
|
||||
//Test 8
|
||||
bigNum = BigInteger.valueOf(97);
|
||||
correctAnswer = true;
|
||||
answer = Algorithms.isPrime(bigNum);
|
||||
assertEquals("isPrime BigInteger 2 failed", correctAnswer, answer);
|
||||
//Test 9
|
||||
bigNum = BigInteger.valueOf(1000);
|
||||
correctAnswer = false;
|
||||
answer = Algorithms.isPrime(bigNum);
|
||||
assertEquals("isPrime BigInteger 3 failed", correctAnswer, answer);
|
||||
}
|
||||
@Test
|
||||
public void testGetFactors() throws InvalidResult{
|
||||
//Test 1
|
||||
ArrayList<Integer> correctAnswer = new ArrayList<Integer>(Arrays.asList(2, 2, 5, 5));
|
||||
@@ -226,6 +276,65 @@ public class TestAlgorithms{
|
||||
assertEquals("factorial BigInteger 4 failed", correctAnswerBig, answerBig);
|
||||
}
|
||||
@Test
|
||||
public void testGCD(){
|
||||
//Test 1
|
||||
int num1 = 2;
|
||||
int num2 = 3;
|
||||
int correctAnswer = 1;
|
||||
int answer = Algorithms.gcd(num1, num2);
|
||||
assertEquals("testGCD Integer 1 failed", correctAnswer, answer);
|
||||
//Test 2
|
||||
num1 = 1000;
|
||||
num2 = 575;
|
||||
correctAnswer = 25;
|
||||
answer = Algorithms.gcd(num1, num2);
|
||||
assertEquals("testGCD Integer 2 failed", correctAnswer, answer);
|
||||
//Test 3
|
||||
num1 = 1000;
|
||||
num2 = 1000;
|
||||
correctAnswer = 1000;
|
||||
answer = Algorithms.gcd(num1, num2);
|
||||
assertEquals("testGCD Integer 3 failed", correctAnswer, answer);
|
||||
|
||||
//Test 4
|
||||
long longNum1 = 2;
|
||||
long longNum2 = 3;
|
||||
long longCorrectAnswer = 1;
|
||||
long longAnswer = Algorithms.gcd(longNum1, longNum2);
|
||||
assertEquals("testGCD Long 1 failed", longCorrectAnswer, longAnswer);
|
||||
//Test 5
|
||||
longNum1 = 1000;
|
||||
longNum2 = 575;
|
||||
longCorrectAnswer = 25;
|
||||
longAnswer = Algorithms.gcd(longNum1, longNum2);
|
||||
assertEquals("testGCD Long 2 failed", longCorrectAnswer, longAnswer);
|
||||
//Test 6
|
||||
longNum1 = 1000;
|
||||
longNum2 = 1000;
|
||||
longCorrectAnswer = 1000;
|
||||
longAnswer = Algorithms.gcd(longNum1, longNum2);
|
||||
assertEquals("testGCD Long 3 failed", longCorrectAnswer, longAnswer);
|
||||
|
||||
//Test 7
|
||||
BigInteger bigNum1 = BigInteger.TWO;
|
||||
BigInteger bigNum2 = BigInteger.valueOf(3);
|
||||
BigInteger bigCorrectAnswer = BigInteger.ONE;
|
||||
BigInteger bigAnswer = Algorithms.gcd(bigNum1, bigNum2);
|
||||
assertEquals("testGCD BigInteger 1 failed", bigCorrectAnswer, bigAnswer);
|
||||
//Test 8
|
||||
bigNum1 = BigInteger.valueOf(1000);
|
||||
bigNum2 = BigInteger.valueOf(575);
|
||||
bigCorrectAnswer = BigInteger.valueOf(25);
|
||||
bigAnswer = Algorithms.gcd(bigNum1, bigNum2);
|
||||
assertEquals("testGCD BigInteger 2 failed", bigCorrectAnswer, bigAnswer);
|
||||
//Test 9
|
||||
bigNum1 = BigInteger.valueOf(1000);
|
||||
bigNum2 = BigInteger.valueOf(1000);
|
||||
bigCorrectAnswer = BigInteger.valueOf(1000);
|
||||
bigAnswer = Algorithms.gcd(bigNum1, bigNum2);
|
||||
assertEquals("testGCD BigInteger 3 failed", bigCorrectAnswer, bigAnswer);
|
||||
}
|
||||
@Test
|
||||
public void testGetSum(){
|
||||
//Test 1
|
||||
Integer correctAnswer = 0;
|
||||
|
||||
Reference in New Issue
Block a user