Merge pull request thuva4#258 from saad1504/algo-branch

thuva4 · web-flow · commit 47c5d46c5da0 · 2017-10-18T21:15:04.000+05:30
Recursive Eucledian Algorithm implementation in C++
diff --git a/GreatestCommonDivisor/C++/GreatestCommonDivisior.cpp b/GreatestCommonDivisor/C++/GreatestCommonDivisior.cpp
@@ -0,0 +1,19 @@
+#include<iostream>
+using namespace std;
+//Recursive Function to calculate GCD 
+int gcd(int a,int b)
+{
+	 if(b==0)
+	 	return a;
+	 else
+	 	return gcd(b,(a%b));
+}
+//Driver program 
+int main()
+{
+	int a,b;
+	cout << "Enter the two numbers to calculate gcd" << endl;
+	cin >> a >>b;
+	cout <<"Gcd of " << a << " " << b << "is "<< gcd(a,b)<< endl;
+	return 0;
+}
diff --git a/GreatestCommonDivisor/C++/a.out b/GreatestCommonDivisor/C++/a.out
diff --git a/README.md b/README.md
@@ -25,7 +25,7 @@ Fast Fourier Transform |  |  |  |  | :+1: |  |  |  |
 Fibonacci | :+1: | :+1: |  | :+1: |  |  | :+1: |  | :+1:
 FisherYatesShuffle | :+1: |  |  |  | :+1: | :+1: |  | :+1: |
 Floyd'sAlgorithm | :+1: | :+1: |  |  | :+1: |  |  |  |
-GreatestCommonDivisor | :+1: |  | :+1: | :+1: |  |  |  |  |
+GreatestCommonDivisor | :+1: |  | :+1: | :+1: | :+1: |   |  |  |
 HammingDistance | :+1: | :+1: |  |  |  | :+1: |  |  |
 HeapSort | :+1: | :+1: |  |  | :+1: | :+1: | :+1: |  | :+1:
 HistogramEqualization | :+1: |  |  |  |  |  |  |  |
