Initial data commit

Task/Greatest-common-divisor/JavaScript/greatest-common-divisor-1.js

@@ -0,0 +1,17 @@
+function gcd(a,b) {
+  a = Math.abs(a);
+  b = Math.abs(b);
+
+  if (b > a) {
+    var temp = a;
+    a = b;
+    b = temp;
+  }
+
+  while (true) {
+    a %= b;
+    if (a === 0) { return b; }
+    b %= a;
+    if (b === 0) { return a; }
+  }
+}

Task/Greatest-common-divisor/JavaScript/greatest-common-divisor-2.js

@@ -0,0 +1,3 @@
+function gcd_rec(a, b) {
+  return b ? gcd_rec(b, a % b) : Math.abs(a);
+}

Task/Greatest-common-divisor/JavaScript/greatest-common-divisor-3.js

@@ -0,0 +1,18 @@
+function GCD(arr) {
+  var i, y,
+      n = arr.length,
+      x = Math.abs(arr[0]);
+
+  for (i = 1; i < n; i++) {
+    y = Math.abs(arr[i]);
+
+    while (x && y) {
+      (x > y) ? x %= y : y %= x;
+    }
+    x += y;
+  }
+  return x;
+}
+
+//For example:
+GCD([57,0,-45,-18,90,447]); //=> 3