[Program]: Find GCD of two numbers by recursion

[harshraj8843]

Description

Write a program to find gcd of two numbers by recursion

GCD (Greatest Common Divisor) of two numbers is the largest number that divides both of them. A simple way to find GCD is to factorize both numbers and multiply common factors.

Input  : 12 18
Output : 6

Tracking Issues

• [x] codinasion/codinasion#3842
• [x] codinasion/codinasion#3843
• [x] codinasion/codinasion#3844
• [x] codinasion/codinasion#3845
• [x] codinasion/codinasion#3846
• [x] codinasion/codinasion#3847
• [x] codinasion/codinasion#3848
• [x] codinasion/codinasion#3849
• [x] codinasion/codinasion#3850
• [x] codinasion/codinasion#3851
• [ ] codinasion/codinasion#3852
• [x] codinasion/codinasion#3853
• [x] codinasion/codinasion#3854
• [x] codinasion/codinasion#3855
• [x] codinasion/codinasion#3856
• [x] codinasion/codinasion#3857
• [ ] codinasion/codinasion#3858
• [x] codinasion/codinasion#3859
• [x] codinasion/codinasion#3860
• [x] codinasion/codinasion#3861

[Shaileshalluri]

!assign

[Shubham-2110]

@harshraj8843 can you please assign me this?

[harshraj8843]

Hey @Shubham-2110

You can comment !assign on any good first issue you want to contribute to, to be auto-assigned

!assign

[harshraj8843]

@Shaileshalluri @Shubham-2110 this is not a good first issue. This issue tracks the progress of related good first issues.

You can find the related good first issues above