GCD es6 code added

Author: me-shaon

Number Theory/GCD/es6/gcd.js

@@ -0,0 +1,19 @@
+/* Greatest Common Divisor (GCD) Finding in JavaScript */
+
+const gcd = (a, b) => {
+	while (true) {
+        var remainder = a%b;
+        if (remainder === 0) return b;
+
+        a = b;
+        b = remainder;
+    }
+}
+
+//A recursive approach to GCD Implementation
+const recursive_gcd = (a, b) => (b === 0) ? a : recursive_gcd(b, a%b);
+
+module.exports = {
+  gcd,
+  recursive_gcd
+}

Number Theory/GCD/es6/test.js

@@ -0,0 +1,8 @@
+const { gcd, recursive_gcd } = require('./gcd');
+
+/************ Testing GCD ***************/
+console.log(gcd(5, 10));
+console.log(gcd(14, 35));
+
+console.log(recursive_gcd(5, 13));
+console.log(recursive_gcd(24, 60));