添加希尔排序

Author: polun

.vscode/tasks.json

@@ -0,0 +1,9 @@
+{
+    // See https://go.microsoft.com/fwlink/?LinkId=733558
+    // for the documentation about the tasks.json format
+    "version": "0.1.0",
+    "command": "echo",
+    "isShellCommand": true,
+    "args": ["Hello World"],
+    "showOutput": "always"
+}

code/01.bubbleSort.js

@@ -1,6 +1,4 @@
-const util = require('./util.js');
-
-function bubbleSort(arr) {
+module.exports = function bubbleSort(arr) {
     const length = arr.length;
 
     for (let i = 0; i < length - 1; i++) {
@@ -14,6 +12,4 @@ function bubbleSort(arr) {
     }
 
     return arr;
-}
-
-util(bubbleSort);
+};

code/02.selectionSort.js

@@ -1,6 +1,4 @@
-const util = require('./util.js');
-
-function selectionSort(arr) {
+module.exports = function selectionSort(arr) {
     const length = arr.length;
     let flag, temp;
 
@@ -18,6 +16,4 @@ function selectionSort(arr) {
     }
 
     return arr;
-}
-
-util(selectionSort);
+};

code/03.insertionSort.js

@@ -1,6 +1,4 @@
-const util = require('./util.js');
-
-function insertionSort(arr) {
+module.exports = function insertionSort(arr) {
     const length = arr.length;
 
     let prefixIndex,
@@ -19,6 +17,4 @@ function insertionSort(arr) {
     }
 
     return arr;
-}
-
-util(insertionSort);
+};

code/04.shellSort.js

@@ -0,0 +1,27 @@
+function shellSort(arr) {
+    const length = arr.length;
+    let h,
+        current,
+        prefixIndex;
+
+
+    h = length >> 1;
+
+    while (h >= 1) {
+        for (let i = h; i < length; i += h) {
+            prefixIndex = i - h;
+            current = arr[i];
+            for (; prefixIndex >= 0 && current < arr[prefixIndex]; prefixIndex -= h) {
+                arr[prefixIndex + h] = arr[prefixIndex];
+            }
+
+            arr[prefixIndex + h] = current;
+        }
+
+        h >>= 1;
+    }
+
+    return arr;
+}
+
+module.exports = shellSort;

code/util.js

@@ -1,11 +1,73 @@
-const os = require('os');
-
-module.exports = function (sort) {
-    console.log(os.EOL + "排序名称:" + sort.name);
-
-    const arr = [12, 3, 10, 11, 1];
-    console.log(arr);
-    console.log('*'.repeat(20) + os.EOL);
-
-    console.log(sort(arr));
-};
+const os = require('os');
+const bubbleSort = require('./01.bubbleSort.js');
+const selectionSort = require('./02.selectionSort.js');
+const insertionSort = require('./03.insertionSort.js');
+const shellSort = require('./04.shellSort.js');
+
+const arrayLength = 10000;
+const testCount = 100;
+
+function randomArray() {
+    const arr = [];
+
+    for (let i = 0; i < arrayLength; i++) {
+        arr.push(Math.floor(Math.random() * 1000));
+    }
+
+    return arr;
+}
+
+function getItemCounter(arr) {
+    const map = new Map();
+
+    arr.forEach(item => {
+        map.has(item) ? map.set(item, map.get(item) + 1) : map.set(item, 1);
+    });
+
+    return map;
+}
+
+/**
+ * 
+ * 
+ * @param {number[]} arr
+ * @param {number[]} sortedArr
+ */
+function check(arr, sortedArr) {
+    for (let i = 0; i < sortedArr.length - 1; i++) {
+        if (sortedArr[i] > sortedArr[i + 1]) {
+            throw new Error('升序排序错误');
+        }
+    }
+
+    const arrMap = getItemCounter(arr);
+    const sortedArrMap = getItemCounter(sortedArr);
+
+    for (let key of arrMap.keys()) {
+        if (sortedArrMap.get(key) === undefined
+            || sortedArrMap.get(key) !== arrMap.get(key)) {
+            throw new Error('排序错误');
+        }
+    }
+
+    return true;
+}
+
+function test(sort, toBeSortedArr) {
+    const innerSorted = toBeSortedArr.slice();
+
+    const sortedArr = sort(innerSorted.slice());
+    check(innerSorted, sortedArr);
+
+    const sTime = Date.now();
+    for (let i = 0; i <= testCount; i++) {
+        sort(innerSorted.slice());
+    }
+
+    console.log(`${arrayLength} elements ${testCount} times test ${sort.name} cost ${Date.now() - sTime} ms`);
+};
+
+const toBeSortedArr = randomArray();
+// test(bubbleSort, toBeSortedArr);
+test(insertionSort, toBeSortedArr);
+test(shellSort, toBeSortedArr);