Class GCDTest
java.lang.Object
topics.divideconquer.gcd.GCDTest
Validation Suite for Greatest Common Divisor
Contrasts the runtime execution bounds of naive scanning versus logarithmic recursion.
- Author:
- vicegd
-
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescription(package private) static voidsetup()(package private) void(package private) void(package private) void(package private) void(package private) void(package private) void
-
Constructor Details
-
GCDTest
GCDTest()
-
-
Method Details
-
setup
@BeforeAll static void setup() -
shouldCalculateNaiveGCDMaxBounds
@Disabled("Demonstration: This test is conceptually correct but structurally too slow (O(N) ceiling).") @Test @DisplayName("Naive: Fails gracefully on maximum boundaries due to time constraints") void shouldCalculateNaiveGCDMaxBounds() -
shouldCalculateNaiveGCDStandard
@Test @DisplayName("Naive: Calculate standard large numbers") void shouldCalculateNaiveGCDStandard() -
shouldCalculateEuclideanGCDMaxBounds
@Test @DisplayName("Euclidean: Solves maximum boundaries instantly (O(log N))") void shouldCalculateEuclideanGCDMaxBounds() -
shouldCalculateEuclideanGCDStandard
@Test @DisplayName("Euclidean: Calculate standard large numbers") void shouldCalculateEuclideanGCDStandard() -
shouldCalculateEuclideanGCDSmall
@Test @DisplayName("Euclidean: Calculate small scale numbers") void shouldCalculateEuclideanGCDSmall() -
shouldHandleNegativeInputs
@Test @DisplayName("Edge Case: Handle negative inputs gracefully") void shouldHandleNegativeInputs()
-