Add GCD implementation using Euclidean algorithm#7189
Add GCD implementation using Euclidean algorithm#7189Swati89923 wants to merge 4 commits intoTheAlgorithms:masterfrom
Conversation
Implemented the Euclidean algorithm for GCD calculation.
Add unit tests for GCDUsingEuclid class covering positive, zero, and negative numbers.
Codecov Report✅ All modified and coverable lines are covered by tests. Additional details and impacted files@@ Coverage Diff @@
## master #7189 +/- ##
============================================
+ Coverage 78.91% 78.92% +0.01%
- Complexity 6883 6886 +3
============================================
Files 774 775 +1
Lines 22746 22758 +12
Branches 4468 4471 +3
============================================
+ Hits 17949 17962 +13
+ Misses 4077 4076 -1
Partials 720 720 ☔ View full report in Codecov by Sentry. 🚀 New features to boost your workflow:
|
|
Hi maintainers 👋 |
|
Hi maintainers 👋 |
|
@Swati89923 whats the difference between your implementation and https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/maths/GCD.java ? |
|
This pull request has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contribution! |
Added a GCD implementation using the Euclidean algorithm along with unit tests.