test: Add Unit Test for LargestPrimeDivisor #241
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Hello, this PR introduces unit tests for the LargestPrimeDivisor program to ensure its correctness across various input scenarios. The tests verify the program’s behavior for small numbers, prime numbers, composite numbers, and negative numbers.
Changes Made:
• Added JUnit 5 test methods with input/output redirection to simulate user input and capture program output.
• Validated program logic against edge cases, including:
• Small numbers and prime numbers.
• Large composite numbers with multiple prime factors.
• Negative numbers, ensuring absolute values are handled correctly.
Test Scenarios:
testSmallNumbers
2\n6\n100\n0\n
-1\n3\n5
testPrimeNumber
17\n0\n
-1
testLargeNumber
13195\n0\n
29
testNegativeNumbers
-100\n0\n
5
Why is this needed?
How to Test:
Run the tests using Maven:
mvn clean test
Verify all tests pass successfully.
Notes:
The test suite includes edge cases like prime numbers, negative inputs, and large composite numbers to validate the robustness of the program logic.