algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-12-19 07:00:35 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add additional edge cases to GCD unit tests (#7174)

Browse Source 
* Add additional edge cases to GCD unit tests

* Rename GCD test methods and add descriptive names

* Fix formatting in GCD tests

---------

Co-authored-by: Deniz Altunkapan <deniz.altunkapan@outlook.com>
This commit is contained in:
Saniya Mane
2025-12-18 13:25:03 +05:30
committed by GitHub
parent 2911a7b52c
commit 7d51c7f320
1 changed files with 39 additions and 19 deletions
Download Patch File Download Diff File Expand all files Collapse all files

58
src/test/java/com/thealgorithms/maths/GCDTest.java
View File

@@ -6,57 +6,77 @@ import org.junit.jupiter.api.Test;
public class GCDTest {
@Test
void test1() {
void testNegativeAndZeroThrowsException() {
Assertions.assertThrows(ArithmeticException.class, () -> GCD.gcd(-1, 0));
}
@Test
void test2() {
void testPositiveAndNegativeThrowsException() {
Assertions.assertThrows(ArithmeticException.class, () -> GCD.gcd(10, -2));
}
@Test
void test3() {
void testBothNegativeThrowsException() {
Assertions.assertThrows(ArithmeticException.class, () -> GCD.gcd(-5, -3));
}
@Test
void test4() {
Assertions.assertEquals(GCD.gcd(0, 2), 2);
void testZeroAndPositiveReturnsPositive() {
Assertions.assertEquals(2, GCD.gcd(0, 2));
}
@Test
void test5() {
Assertions.assertEquals(GCD.gcd(10, 0), 10);
void testPositiveAndZeroReturnsPositive() {
Assertions.assertEquals(10, GCD.gcd(10, 0));
}
@Test
void test6() {
Assertions.assertEquals(GCD.gcd(1, 0), 1);
void testOneAndZeroReturnsOne() {
Assertions.assertEquals(1, GCD.gcd(1, 0));
}
@Test
void test7() {
Assertions.assertEquals(GCD.gcd(9, 6), 3);
void testTwoPositiveNumbers() {
Assertions.assertEquals(3, GCD.gcd(9, 6));
}
@Test
void test8() {
Assertions.assertEquals(GCD.gcd(48, 18, 30, 12), 6);
void testMultipleArgumentsGcd() {
Assertions.assertEquals(6, GCD.gcd(48, 18, 30, 12));
}
@Test
void testArrayGcd1() {
Assertions.assertEquals(GCD.gcd(new int[] {9, 6}), 3);
void testArrayInputGcd() {
Assertions.assertEquals(3, GCD.gcd(new int[] {9, 6}));
}
@Test
void testArrayGcd2() {
Assertions.assertEquals(GCD.gcd(new int[] {2 * 3 * 5 * 7, 2 * 5 * 5 * 5, 2 * 5 * 11, 5 * 5 * 5 * 13}), 5);
void testArrayWithCommonFactor() {
Assertions.assertEquals(5, GCD.gcd(new int[] {2 * 3 * 5 * 7, 2 * 5 * 5 * 5, 2 * 5 * 11, 5 * 5 * 5 * 13}));
}
@Test
void testArrayGcdForEmptyInput() {
Assertions.assertEquals(GCD.gcd(new int[] {}), 0);
void testEmptyArrayReturnsZero() {
Assertions.assertEquals(0, GCD.gcd(new int[] {}));
}
@Test
void testSameNumbers() {
Assertions.assertEquals(7, GCD.gcd(7, 7));
}
@Test
void testPrimeNumbersHaveGcdOne() {
Assertions.assertEquals(1, GCD.gcd(13, 17));
}
@Test
void testSingleElementArrayReturnsElement() {
Assertions.assertEquals(42, GCD.gcd(new int[] {42}));
}
@Test
void testLargeNumbers() {
Assertions.assertEquals(12, GCD.gcd(123456, 789012));
}
}