From 7e039c2383ca26bf1d5a3efc58d3221aaebd905c Mon Sep 17 00:00:00 2001
From: RG0512 <56762898+RG0512@users.noreply.github.com>
Date: Sat, 19 Oct 2019 19:34:21 +0530
Subject: [PATCH] Create arrayGCD.java

---
 raj/arrayGCD.java | 32 ++++++++++++++++++++++++++++++++
 1 file changed, 32 insertions(+)
 create mode 100644 raj/arrayGCD.java

diff --git a/raj/arrayGCD.java b/raj/arrayGCD.java
new file mode 100644
index 0000000..c16a870
--- /dev/null
+++ b/raj/arrayGCD.java
@@ -0,0 +1,32 @@
+// Java program to find GCD of two or 
+// more numbers 
+
+public class GCD { 
+	// Function to return gcd of a and b 
+	static int gcd(int a, int b) 
+	{ 
+		if (a == 0) 
+			return b; 
+		return gcd(b % a, a); 
+	} 
+
+	// Function to find gcd of array of 
+	// numbers 
+	static int findGCD(int arr[], int n) 
+	{ 
+		int result = arr[0]; 
+		for (int i = 1; i < n; i++) 
+			result = gcd(arr[i], result); 
+
+		return result; 
+	} 
+
+	public static void main(String[] args) 
+	{ 
+		int arr[] = { 2, 4, 6, 8, 16 }; 
+		int n = arr.length; 
+		System.out.println(findGCD(arr, n)); 
+	} 
+} 
+
+// This code is contributed by Saket Kumar