Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We鈥檒l occasionally send you account related emails.

Already on GitHub? Sign in to your account

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

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

Comments

@panda311
Copy link

@panda311 panda311 commented Oct 15, 2019

  • 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 )
@ajaykumarr123

This comment has been minimized.

Copy link

@ajaykumarr123 ajaykumarr123 commented Oct 16, 2019

i want to implement this.

@palakjadwani

This comment has been minimized.

Copy link

@palakjadwani palakjadwani commented Oct 19, 2019

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

@karan221

This comment has been minimized.

Copy link

@karan221 karan221 commented Oct 28, 2019

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

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
5 participants
You can鈥檛 perform that action at this time.