Initial data commit

Task/Greatest-common-divisor/Java/greatest-common-divisor-1.java

@@ -0,0 +1,4 @@
+/* recursive */
+int gcd(int a, int b) {
+    return (b == 0) ? a : gcd(b, a % b);
+}

Task/Greatest-common-divisor/Java/greatest-common-divisor-2.java

@@ -0,0 +1,9 @@
+public static long gcd(long a, long b){
+   long factor= Math.min(a, b);
+   for(long loop= factor;loop > 1;loop--){
+      if(a % loop == 0 && b % loop == 0){
+         return loop;
+      }
+   }
+   return 1;
+}

Task/Greatest-common-divisor/Java/greatest-common-divisor-3.java

@@ -0,0 +1,10 @@
+public static int gcd(int a, int b) //valid for positive integers.
+{
+	while(b > 0)
+	{
+		int c = a % b;
+		a = b;
+		b = c;
+	}
+	return a;
+}

Task/Greatest-common-divisor/Java/greatest-common-divisor-4.java

@@ -0,0 +1,8 @@
+static int gcd(int a,int b)
+	{
+		int min=a>b?b:a,max=a+b-min, div=min;
+		for(int i=1;i<min;div=min/++i)
+			if(min%div==0&&max%div==0)
+				return div;
+		return 1;
+	}

Task/Greatest-common-divisor/Java/greatest-common-divisor-5.java

@@ -0,0 +1,30 @@
+public static long gcd(long u, long v){
+  long t, k;
+
+  if (v == 0) return u;
+
+  u = Math.abs(u);
+  v = Math.abs(v);
+  if (u < v){
+    t = u;
+    u = v;
+    v = t;
+  }
+
+  for(k = 1; (u & 1) == 0 && (v & 1) == 0; k <<= 1){
+    u >>= 1; v >>= 1;
+  }
+
+  t = (u & 1) != 0 ? -v : u;
+  while (t != 0){
+    while ((t & 1) == 0) t >>= 1;
+
+    if (t > 0)
+      u = t;
+    else
+      v = -t;
+
+    t = u - v;
+  }
+  return u * k;
+}

Task/Greatest-common-divisor/Java/greatest-common-divisor-6.java

@@ -0,0 +1,6 @@
+public static long gcd(long a, long b){
+   if(a == 0) return b;
+   if(b == 0) return a;
+   if(a > b) return gcd(b, a % b);
+   return gcd(a, b % a);
+}

Task/Greatest-common-divisor/Java/greatest-common-divisor-7.java

@@ -0,0 +1,5 @@
+import java.math.BigInteger;
+
+public static long gcd(long a, long b){
+   return BigInteger.valueOf(a).gcd(BigInteger.valueOf(b)).longValue();
+}