Algorithm for finding GCD of an array of elements Added

Bharat-Reddy · Bharat-Reddy · commit 1230d1fb0e99 · 2018-10-02T09:03:57.000+05:30
diff --git a/math/gcd_of_array.cpp b/math/gcd_of_array.cpp
@@ -0,0 +1,36 @@
+// C++ program to find GCD of an array of integers
+//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 findGCD(int arr[], int n) 
+{ 
+    int result = arr[0]; 
+    for (int i = 1; i < n; i++) 
+        result = gcd(arr[i], result); 
+  
+    return result; 
+} 
+  
+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]; 
+    cout << findGCD(a, n) << endl; 
+    return 0; 
+} 
