From 396e69b08f535f6e1441dabbc910788ff9212cb2 Mon Sep 17 00:00:00 2001 From: Mattrixwv Date: Thu, 11 Mar 2021 14:53:26 -0500 Subject: [PATCH] Fixed typos --- src/test/java/mattrixwv/TestAlgorithms.java | 33 ++++++++++----------- 1 file changed, 16 insertions(+), 17 deletions(-) diff --git a/src/test/java/mattrixwv/TestAlgorithms.java b/src/test/java/mattrixwv/TestAlgorithms.java index 65d3f9f..05b31b7 100644 --- a/src/test/java/mattrixwv/TestAlgorithms.java +++ b/src/test/java/mattrixwv/TestAlgorithms.java @@ -177,24 +177,24 @@ public class TestAlgorithms{ Integer correctAnswer = 144; Integer number = 12; Integer answer = Algorithms.getFib(number); - assertEquals("getDivisors Integer 1 failed", correctAnswer, answer); + assertEquals("getFib Integer 1 failed", correctAnswer, answer); //Test 2 correctAnswer = 6765; number = 20; answer = Algorithms.getFib(number); - assertEquals("getDivisors Integer 2 failed", correctAnswer, answer); + assertEquals("getFib Integer 2 failed", correctAnswer, answer); //Test 3 Long longCorrectAnswer = 6765L; Long longNumber = 20L; Long longAnswer = Algorithms.getFib(longNumber); - assertEquals("getDivisors Long failed", longCorrectAnswer, longAnswer); + assertEquals("getFib Long failed", longCorrectAnswer, longAnswer); //Test 4 BigInteger bigCorrectAnswer = new BigInteger("1070066266382758936764980584457396885083683896632151665013235203375314520604694040621889147582489792657804694888177591957484336466672569959512996030461262748092482186144069433051234774442750273781753087579391666192149259186759553966422837148943113074699503439547001985432609723067290192870526447243726117715821825548491120525013201478612965931381792235559657452039506137551467837543229119602129934048260706175397706847068202895486902666185435124521900369480641357447470911707619766945691070098024393439617474103736912503231365532164773697023167755051595173518460579954919410967778373229665796581646513903488154256310184224190259846088000110186255550245493937113651657039447629584714548523425950428582425306083544435428212611008992863795048006894330309773217834864543113205765659868456288616808718693835297350643986297640660000723562917905207051164077614812491885830945940566688339109350944456576357666151619317753792891661581327159616877487983821820492520348473874384736771934512787029218636250627816"); BigInteger bigNumber = BigInteger.valueOf(4782); BigInteger bigAnswer = Algorithms.getFib(bigNumber); - assertEquals("getDivisors BigInteger failed", bigCorrectAnswer, bigAnswer); + assertEquals("getFib BigInteger failed", bigCorrectAnswer, bigAnswer); } @Test public void testGetAllFib(){ @@ -203,7 +203,6 @@ public class TestAlgorithms{ Integer highestNumber = 100; ArrayList answer = Algorithms.getAllFib(highestNumber); assertEquals("getAllFib Integer 1 failed", correctAnswer, answer); - //Test 2 correctAnswer = new ArrayList(Arrays.asList(1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987)); highestNumber = 1000; @@ -282,57 +281,57 @@ public class TestAlgorithms{ int num2 = 3; int correctAnswer = 1; int answer = Algorithms.gcd(num1, num2); - assertEquals("testGCD Integer 1 failed", correctAnswer, answer); + assertEquals("GCD 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); + assertEquals("GCD 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); + assertEquals("GCD 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); + assertEquals("GCD 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); + assertEquals("GCD 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); + assertEquals("GCD 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); + assertEquals("GCD 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); + assertEquals("GCD 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); + assertEquals("GCD BigInteger 3 failed", bigCorrectAnswer, bigAnswer); } @Test public void testGetSum(){ @@ -465,16 +464,16 @@ public class TestAlgorithms{ char testChar = 'a'; long correctAnswer = 1; long answer = Algorithms.findNumOccurrence(testString, testChar); - assertEquals(correctAnswer, answer); + assertEquals("FindNumOccurrence 1 failed", correctAnswer, answer); //Test 2 testChar = 'd'; correctAnswer = 3; answer = Algorithms.findNumOccurrence(testString, testChar); - assertEquals(correctAnswer, answer); + assertEquals("FindNumOccurrence 2 failed", correctAnswer, answer); //Test 3 testChar = 'h'; correctAnswer = 0; answer = Algorithms.findNumOccurrence(testString, testChar); - assertEquals(correctAnswer, answer); + assertEquals("FindNumOccurrence 3 failed", correctAnswer, answer); } }