Add GCD function to math directory#111
Closed
PauLopNun wants to merge 10 commits intoTheAlgorithms:masterfrom
PauLopNun:master
Closed
Add GCD function to math directory#111PauLopNun wants to merge 10 commits intoTheAlgorithms:masterfrom PauLopNun:master
PauLopNun wants to merge 10 commits intoTheAlgorithms:masterfrom
PauLopNun:master
Conversation
Add GCD function using Euclid's algorithm
Add isPrime function to check prime numbers
Add LCM and GCD functions in LCM.kt
Implement Fibonacci function using iteration
Add nCr function to compute combinations
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
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.
This PR adds a function to compute the Greatest Common Divisor (GCD) of two integers using Euclid's algorithm in Kotlin. A main() function is included to demonstrate usage.