Merge pull request #178 from deyRupak/my-new-feature2

Added Merge Sort & Euclidean GCD using Javascript

Author: xlogix

euclidean_gcd/javascript/euclidean_gcd.js

@@ -0,0 +1,8 @@
+function gcd(a, b) {
+    if (b == 0)
+        return a;
+    else
+        return gcd(b, (a % b));
+}
+
+console.log(gcd(gcd(203, 91), 77))

merge_sort/javascript/mergeSort.js

@@ -0,0 +1,29 @@
+const list = [5, 4, -3, 2, 1]
+
+const mergeSort = (list) => {
+    if (list.length <= 1) return list;
+    const middle = list.length / 2;
+    const left = list.slice(0, middle);
+    const right = list.slice(middle, list.length);
+    return merge(mergeSort(left), mergeSort(right));
+}
+
+const merge = (left, right) => {
+    var result = [];
+    while (left.length || right.length) {
+        if (left.length && right.length) {
+            if (left[0] < right[0]) {
+                result.push(left.shift())
+            } else {
+                result.push(right.shift())
+            }
+        } else if (left.length) {
+            result.push(left.shift())
+        } else {
+            result.push(right.shift())
+        }
+    }
+    return result;
+}
+
+console.log(mergeSort(list))