Euclid Algorithm for GCD (Greatest common divisor)

[Ashutoshpandey-coder]

🚀 Feature

(Write down a clear and concise description of what the feature is.)

Have you read the Contribution Guidelines?

(Write your answer here.) Yes , I read all the guidlines .

Pitch

(Please explain why this feature should be implemented and how it would be used.) It is the best way of finding the Greatest Common Divisor . Euclid Algo -> According to this algorithm if b is smaller than a. gcd(a,b) = gcd(a-b, b) Let g be GCD of a and b a = gx , b = gy and GCD(x,y) = 1 (a-b) = g(x-y)

Assignees

(Do not make changes in this section until asked to do so)
C - @Ashutoshpandey-coder C# -
C++ - @tm2k23 Go -
Java - @Ashutoshpandey-coder Javascript -
Kotlin -
Python - @Noxbolt

[manan025]

Which language do you want to work on @Ashutoshpandey-coder ?

[Ashutoshpandey-coder]

Which language do you want to work on @Ashutoshpandey-coder ?

in java language or if you want anyother I can also do it , familiar with c , cpp .

[manan025]

@Ashutoshpandey-coder - Java assigned (If you want to work in any other language, you can ask here after you complete it in java)

[Ashutoshpandey-coder]

@Ashutoshpandey-coder - Java assigned (If you want to work in any other language, you can ask here after you complete it in java)

okay sure

[tm2k23]

@manan025 add me for c++

[manan025]

@tm2k23 - C++ assigned

[Ashutoshpandey-coder]

@Ashutoshpandey-coder - Java assigned (If you want to work in any other language, you can ask here after you complete it in java)

okay sure

I would like to do in C also. Could you assign me?

[manan025]

@Ashutoshpandey-coder - C assigned

[tarunkrjaiswal]

I can contribute in python

[SOURHEAD]

I can contribute in python @manan025

[manan025]

@Noxbolt - Python assigned

[manan025]

@SOURHEAD He asked first so it will be assigned to him.

[lucblassel]

I'll try my hand at go if possible