Merge pull request ashutosh97#74 from miketu926/mergesort

Added Merge Sort

Author: ashutosh97

Mergesort-JS/mergeSort.js

@@ -0,0 +1,33 @@
+const myArray = [2, 4, 1, 6, -7, 8, 5, 9, 3, 4];
+
+const mergeSort = (arr) => {
+  if (arr.length <= 1) {
+    return arr;
+  }
+
+  let midIdx = Math.floor(arr.length / 2);
+  let left = arr.slice(0, midIdx);
+  let right = arr.slice(midIdx);
+
+  let leftSorted = mergeSort(left);
+  let rightSorted = mergeSort(right);
+
+  return merge(leftSorted, rightSorted);
+
+};
+
+const merge = (arr1, arr2) => {
+  let merged = [];
+
+  while (arr1.length && arr2.length) {
+    if (arr1[0] < arr2[0]) {
+      merged.push(arr1.shift());
+    } else {
+      merged.push(arr2.shift());
+    }
+  }
+
+  return [...merged, ...arr1, ...arr2];
+};
+
+console.log(mergeSort(myArray));

Mergesort-JS/question.txt

@@ -0,0 +1,5 @@
+Sort the given by implementing Quicksort
+[2, 4, 1, 6, -7, 8, 5, 9, 3, 4]
+
+answer:
+[ -7, 1, 2, 3, 4, 4, 5, 6, 8, 9 ]