feat: sort

Author: Z1hgq

js-sort/InsertSort.js

@@ -14,9 +14,10 @@
  * 6. 重复步骤2~5。
 */
 const InsertSort = (arr = []) => {
+    let cur, index;
     for (let i = 1; i < arr.length; i++) {
-        const cur = arr[i];
-        let index = i - 1;
+        cur = arr[i];
+        index = i - 1;
         while (index > 0 && cur < arr[index]) {
             arr[index + 1] = arr[index];
             index--;

js-sort/MapSort.js

@@ -13,13 +13,12 @@
  * @returns 'object Array'
  */
 const MapSort = (arr = []) => {
-    console.log(this);
     for (let i = 0; i < arr.length; i++) {
-        for (let j = i + 1; j < arr.length; j++) {
-            if (arr[i] > arr[j]) {
-                const temp = arr[i];
-                arr[i] = arr[j];
-                arr[j] = temp;
+        for (let j = 0; j < arr.length - 1 - i; j++) {
+            if (arr[j] > arr[j + 1]) {
+                const temp = arr[j];
+                arr[j] = arr[j + 1];
+                arr[j + 1] = temp;
             }
         }
     }

js-sort/MergeSort.js

@@ -0,0 +1,27 @@
+
+
+const MergeSort = (arr) => {
+    const len = arr.length;
+    if (len < 2) return arr;
+    const middle = Math.floor(len / 2);
+    const left = arr.slice(0, middle);
+    const right = arr.slice(middle);
+    return merge(MergeSort(left), MergeSort(right));
+}
+const merge = (left, right) => {
+    const res = [];
+    while (left.length > 0 && right.length > 0) {
+        if (left[0] < right[0]) {
+            res.push(left.shift());
+        } else {
+            res.push(right.shift());
+        }
+    }
+    while (left.length) {
+        res.push(left.shift());
+    }
+    while (right.length) {
+        res.push(right.shift());
+    }
+    return res;
+}

js-sort/QuickSort.js

@@ -0,0 +1,32 @@
+function quickSort(arr, left, right) {
+    var len = arr.length,
+        partitionIndex,
+        left = typeofleft != 'number' ? 0 : left,
+        right = typeofright != 'number' ? len - 1 : right;
+
+    if (left < right) {
+        partitionIndex = partition(arr, left, right);
+        quickSort(arr, left, partitionIndex - 1);
+        quickSort(arr, partitionIndex + 1, right);
+    }
+    return arr;
+}
+
+function partition(arr, left, right) {    // 分区操作
+    var pivot = left,                     // 设定基准值（pivot）
+        index = pivot + 1;
+    for (var i = index; i <= right; i++) {
+        if (arr[i] < arr[pivot]) {
+            swap(arr, i, index);
+            index++;
+        }
+    }
+    swap(arr, pivot, index - 1);
+    return index - 1;
+}
+
+function swap(arr, i, j) {
+    vartemp = arr[i];
+    arr[i] = arr[j];
+    arr[j] = temp;
+}

js-sort/SelectSort.js

@@ -5,4 +5,21 @@
  * @LastEditTime: 2021-03-15 17:12:55
  */
 
+const SelectSort = (arr) => {
+    const len = arr.length;
+    for (let i = 0; i < len; i++) {
+        let minIndex = i;
+        for (let j = i + 1; j < len; j++) {
+            if (arr[j] < arr[minIndex]) {
+                minIndex = j;
+            }
+        }
+        const temp = arr[minIndex];
+        arr[minIndex] = arr[i];
+        arr[i] = temp;
+    }
+}
+const a = [10, 1, 2, 4, 5, 1, 2, 7, 6, 4, 7, 8];
+SelectSort(a);
+console.log(a);
 

js/obj2arr.js

@@ -30,11 +30,11 @@ const deep = (node) => {
             name: cur.name
         })
         const children = cur.children;
-        if (children && children.length) [
+        if (children && children.length) {
             children.forEach(item => {
                 stack.push(item);
             })
-        ]
+        }
     }
     console.log(res);
 }