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’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Add explanation or links for Euclidean Algorithm. #81

Open
aenon opened this issue Feb 23, 2018 · 0 comments
Open

Add explanation or links for Euclidean Algorithm. #81

aenon opened this issue Feb 23, 2018 · 0 comments

Comments

@aenon
Copy link

aenon commented Feb 23, 2018

In 4. Greatest Common Divisor of JS: Interview Algorithm part -1: beginner, you mentioned a fancy algorithm that you don't understand.

It is called Euclidean Algorithm. I am thinking that you probably should give a link here so that readers can read and understand. You can link to the Wikipedia page, or some other good explanations found online.

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

No branches or pull requests

1 participant