Skip to content
This repository has been archived by the owner on Mar 4, 2020. It is now read-only.

Find GCD of Two Numbers using Euclidean's Algorithm #116

Open
panda311 opened this issue Oct 15, 2019 · 3 comments
Open

Find GCD of Two Numbers using Euclidean's Algorithm #116

panda311 opened this issue Oct 15, 2019 · 3 comments
Labels

Comments

@panda311
Copy link
Contributor

  • Please follow the Contributing Guidelines & naming conventions in the guidelines accordingly. 🙂
  • Following naming guidelines is important to maintain consistency.😊
  • Please NOTE: In case, same implementation of an algorithm is submitted by someone else and it gets accepted, then your contribution won't be merged ( to avoid duplicates )
@panda311 panda311 added Hacktoberfest for Hacktoberfest good first issue Good for newcomers help wanted Extra attention is needed labels Oct 15, 2019
@ajaykumarr123
Copy link

i want to implement this.

@palakjadwani
Copy link

Can I take this up as I can see there has been no PR

@karan221
Copy link

karan221 commented Oct 28, 2019

Hey, added euclid's gcd and and extended gcd algorithms in cpp.

Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.
Labels
Projects
None yet
Development

No branches or pull requests

5 participants