Merge pull request AllAlgorithms#15 from Bharat-Reddy/master

abranhe · web-flow · commit 0b13f3e52891 · 2018-10-01T23:31:12.000-04:00
Euclids GCD Algorithm added
diff --git a/math/euclids_gcd_algo.cpp b/math/euclids_gcd_algo.cpp
@@ -0,0 +1,23 @@
+// C++ program to demonstrate Basic Euclidean Algorithm 
+// Author Bharat Reddy
+
+#include <bits/stdc++.h> 
+using namespace std; 
+  
+
+int gcd(int a, int b) 
+{ 
+    if (a == 0) 
+        return b; 
+    return gcd(b % a, a); 
+} 
+  
+int main() 
+{ 
+    int a,b;
+    cout<<"Enter 2 numbers : ";
+    cin>>a>>b;
+    int g_c_d = gcd(a,b);
+    cout<<"GCD is <<g_c_d<<endl;
+    return 0; 
+} 
diff --git a/math/lcm_of_array.cpp b/math/lcm_of_array.cpp
@@ -0,0 +1,42 @@
+// C++ program to find LCM of n elements
+// Author Bharat Reddy
+
+#include <bits/stdc++.h> 
+using namespace std; 
+  
+typedef long long int ll; 
+  
+
+int gcd(int a, int b) 
+{ 
+    if (b == 0) 
+        return a; 
+    return gcd(b, a % b); 
+} 
+  
+// Returns LCM of array elements 
+ll findlcm(int arr[], int n) 
+{ 
+ 
+    ll ans = arr[0]; 
+  
+    for (int i = 1; i < n; i++) 
+        ans = (((arr[i] * ans)) / 
+                (gcd(arr[i], ans))); 
+  
+    return ans; 
+} 
+  
+int main() 
+{ 
+    int n;
+    cout<<"Enter size of array : ";
+    cin>>n; 
+    int a[n];
+    cout<<"Enter elements of array"<<endl;
+    int i;
+    for(i=0;i<n;i++)
+        cin>>a[i];
+    printf("%lld\n", findlcm(a, n)); 
+    return 0; 
+} 
