gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Add C++ code (#25437)

Browse Source 
* Add C++ code

* fix: removed recursive version
This commit is contained in:
rish9898
2019-02-14 04:33:42 +05:30
committed by Randell Dawson
parent 36e356e6fd
commit 99f25ca627
1 changed files with 13 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
guide/english/algorithms/greatest-common-divisor-euclidean/index.md
View File

@ -65,6 +65,19 @@ function gcd(a, b) {
} }
``` ```
C++ Code to Perform GCD-
```csharp
int gcd(int a,int b) {
int R;
while ((a % b) > 0) {
R = a % b;
a = b;
b = R;
}
return b;
}
```
Python Code to Perform GCD using Recursion Python Code to Perform GCD using Recursion
```Python ```Python
def gcd(a, b): def gcd(a, b):
@ -87,7 +100,6 @@ static int gcd(int a, int b)
``` ```
You can also use the Euclidean Algorithm to find GCD of more than two numbers. You can also use the Euclidean Algorithm to find GCD of more than two numbers.
Since, GCD is associative, the following operation is valid- `GCD(a,b,c) == GCD(GCD(a,b), c)` Since, GCD is associative, the following operation is valid- `GCD(a,b,c) == GCD(GCD(a,b), c)`