Added merge sort without color correction on the bar

Bappy4u · Bappy4u · commit 45100a111d4e · 2021-11-10T03:59:20.000+06:00
diff --git a/function.js b/function.js
@@ -150,6 +150,85 @@ const SortAlgo = {
     sort(this);
   },
 
+  //Merge Sort methods to perform merge sort algorithm
+  mergeSort() {
+    const timer = (ms) => new Promise((res) => setTimeout(res, ms));
+
+    // async function for selection sort algorithm
+    async function sort(self) {
+      function merge(arr, l, m, r) {
+        var n1 = m - l + 1;
+        var n2 = r - m;
+
+        // Create temp arrays
+        var L = new Array(n1);
+        var R = new Array(n2);
+
+        // Copy data to temp arrays L[] and R[]
+        for (var i = 0; i < n1; i++) L[i] = arr[l + i];
+        for (var j = 0; j < n2; j++) R[j] = arr[m + 1 + j];
+
+        // Merge the temp arrays back into arr[l..r]
+
+        // Initial index of first subarray
+        var i = 0;
+
+        // Initial index of second subarray
+        var j = 0;
+
+        // Initial index of merged subarray
+        var k = l;
+
+        while (i < n1 && j < n2) {
+          if (L[i] <= R[j]) {
+            arr[k] = L[i];
+            i++;
+          } else {
+            arr[k] = R[j];
+            j++;
+          }
+          k++;
+        }
+
+        // Copy the remaining elements of
+        // L[], if there are any
+        while (i < n1) {
+          arr[k] = L[i];
+          i++;
+          k++;
+        }
+
+        // Copy the remaining elements of
+        // R[], if there are any
+        while (j < n2) {
+          arr[k] = R[j];
+          j++;
+          k++;
+        }
+      }
+
+      // l is for left index and r is
+      // right index of the sub-array
+      // of arr to be sorted */
+      function mergeSort(arr, l, r) {
+        if (l >= r) {
+          return; //returns recursively
+        }
+        var m = l + parseInt((r - l) / 2);
+        mergeSort(arr, l, m);
+        mergeSort(arr, m + 1, r);
+        merge(arr, l, m, r);
+      }
+      mergeSort(data, 0, data.length - 1);
+      swapBar(data);
+      isSorting = false;
+      isSorted = true;
+      togglePlay();
+    }
+    // calling sort function here
+    sort(this);
+  },
+
   // If user wants to stop the sorting process then this function will be called and sorting algorithm will be stopped immediately.
   sortStop() {
     this.abort = true;
@@ -168,6 +247,9 @@ function startSorting() {
   } else if (getAlgo() == "selection-sort") {
     const selectionSortStarted = SortAlgo.selectionSort.bind(SortAlgo);
     selectionSortStarted();
+  } else if (getAlgo() == "merge-sort") {
+    const mergeSortStarted = SortAlgo.mergeSort.bind(SortAlgo);
+    mergeSortStarted();
   }
 }
 
diff --git a/index.html b/index.html
@@ -32,6 +32,10 @@ <h1>Sorting Algorithm Visualizer</h1>
             value="selection-sort"
           />Selection Sort</label
         >
+        <label>
+          <input type="radio" name="algo-name" value="merge-sort" />Merge
+          Sort</label
+        >
 
         <br />
         <br />
