Merge pull request #6 from i-vishi/master

Euclidian algorithm to find GCD of two numbers
VAR-solutions · Oct 1, 2018 · ac3eb0d · ac3eb0d
2 parents 115edbf + 9fd5546
commit ac3eb0d
Showing 1 changed file with 17 additions and 0 deletions.
diff --git a/CPP/GCD.cpp b/CPP/GCD.cpp
@@ -0,0 +1,17 @@
+
+// C++ program to find GCD of two numbers
+#include <iostream>
+
+// Recursive function to return gcd of a and b
+int gcd(int a, int b){
+    if (b == 0)
+        return a;
+    return gcd(b, a % b);
+}
+
+int main(){
+    int a, b;
+	cin>>a>>b;
+    cout<<"GCD of "<<a<<"and "<<b<<"is : "<<gcd(a, b)<<endl;
+    return 0;
+}