Skip to content

Conversation

@os-moussao
Copy link
Contributor

  • Handle gcd of negative numbers
  • Fix the case when one of the numbers is equal to zero
  • Improve time complexity (from linear to logarithmic) using modulo instead of repeated subtractions
  • Update unit tests to cover edge cases and different scenarios
- handle gcd of negative numbers - fix the case when one of the numbers is equal to zero, gcd(0, x) = absolute value of x - optimize using modulo instead of repeated subtractions
- add more tests to cover edge cases and different scenarios - delete incorrect test (gcd(1, 0) = 0)
@os-moussao
Copy link
Contributor Author

Hello @loiane, would you like to review this PR?

@loiane
Copy link
Owner

loiane commented Dec 20, 2023

Thanks for the PR @os-moussao!

@loiane loiane merged commit 25596e4 into loiane:main Dec 20, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

2 participants