JS排序算法知识点

1.查询带键的排列

function (queries, m) {
  let p = [];
  for (let i = 1; i <= m; i++) {
    p.push(i);
  }
  let res = [];
  for (let i = 0; i < queries.length; i++) {
    let index = p.indexOf(queries[i]);
    res.push(index);
    p.splice(index, 1);
    p.unshift(queries[i]);
  }
  return res;
};

2.处理文件大小展示

function formatFileSize (size, pointLength = 2) {
    let unitArr = ['B', 'KB', 'MB', 'GB', 'TB', 'PB', 'EB', 'ZB', 'YB'] // 单位数组
    let index = 0 // 单位数组下标
    let srcsize = parseFloat(size) // 转换为浮点数
    index = Math.floor(Math.log(srcsize) / Math.log(1024)) // 获取单位数组下标
    let sizeStr = srcsize / Math.pow(1024, index) // 计算单位
    sizeStr = sizeStr.toFixed(pointLength) // 保留小数点后几位
    return sizeStr + unitArr[index] // 返回大小和单位
}

3.递归深拷贝

function deepCopy (obj) {
    if (typeof obj !== 'object') return obj
    let newObj = obj instanceof Array ? [] : {} // 判断是数组还是对象 instanceof 用于判断一个变量是否是某个对象的实例
    for (let key in obj) {
        if (obj.hasOwnProperty(key)) { // hasOwnProperty() 方法会返回一个布尔值，指示对象自身属性中是否具有指定的属性（也就是，是否有指定的键）。
            newObj[key] = typeof obj[key] === 'object' ? deepCopy(obj[key]) : obj[key] // 递归
        }
    }
    return newObj
}

4.冒泡排序

function bubbleSort (arr) {
    for (let i = 0; i < arr.length; i++) {
        for (let j = 0; j < arr.length - i - 1; j++) {
            if (arr[j] > arr[j + 1]) {
                let temp = arr[j];
                arr[j] = arr[j + 1];
                arr[j + 1] = temp;
            }
        }
    }
    return arr;
}
console.log(bubbleSort([1, 3, 2, 5, 4, 6, 7, 9, 8]));

5.选择排序

function selectSort (arr) {
    for (let i = 0; i < arr.length; i++) {
        let minIndex = i;
        for (let j = i + 1; j < arr.length; j++) {
            if (arr[j] < arr[minIndex]) {
                minIndex = j;
            }
        }
        let temp = arr[i];
        arr[i] = arr[minIndex];
        arr[minIndex] = temp;
    }
    return arr;
}
console.log(selectSort([1, 3, 2, 5, 4, 6, 7, 9, 8]));

6.插入排序

function insertSort (arr) {
    for (let i = 1; i < arr.length; i++) {
        let temp = arr[i];
        let j = i - 1;
        while (j >= 0 && arr[j] > temp) {
            arr[j + 1] = arr[j];
            j--;
        }
        arr[j + 1] = temp;
    }
    return arr;
}
console.log(insertSort([1, 3, 2, 5, 4, 6, 7, 9, 8]));

7.快速排序

function quickSort (arr) {
    if (arr.length <= 1) {
        return arr;
    }
    let left = [];
    let right = [];
    let mid = arr.splice(0, 1);
    for (let i = 0; i < arr.length; i++) {
        if (arr[i] < mid) {
            left.push(arr[i]);
        } else {
            right.push(arr[i]);
        }
    }
    return quickSort(left).concat(mid, quickSort(right));
}
console.log(quickSort([1, 3, 2, 5, 4, 6, 7, 9, 8]));

8.归并排序

function mergeSort (arr) {
    if (arr.length <= 1) {
        return arr;
    }
    let mid = Math.floor(arr.length / 2);
    let left = arr.slice(0, mid);
    let right = arr.slice(mid);
    return merge(mergeSort(left), mergeSort(right));
}
function merge (left, right) {
    let result = [];
    while (left.length && right.length) {
        if (left[0] <= right[0]) {
            result.push(left.shift());
        } else {
            result.push(right.shift());
        }
    }
    while (left.length) {
        result.push(left.shift());
    }
    while (right.length) {
        result.push(right.shift());
    }
    return result;
}
console.log(mergeSort([1, 3, 2, 5, 4, 6, 7, 9, 8]));

9.堆排序

function heapSort (arr) {
    let len = arr.length;
    buildMaxHeap(arr);
    for (let i = len - 1; i > 0; i--) {
        swap(arr, 0, i);
        len--;
        heapify(arr, 0, len);
    }
    return arr;
}
function buildMaxHeap (arr) {
    let len = arr.length;
    for (let i = Math.floor(len / 2); i >= 0; i--) {
        heapify(arr, i, len);
    }
}
function heapify (arr, i, len) {
    let left = 2 * i + 1;
    let right = 2 * i + 2;
    let largest = i;
    if (left < len && arr[left] > arr[largest]) {
        largest = left;
    }
    if (right < len && arr[right] > arr[largest]) {
        largest = right;
    }
    if (largest != i) {
        swap(arr, i, largest);
        heapify(arr, largest, len);
    }
}
function swap (arr, i, j) {
    let temp = arr[i];
    arr[i] = arr[j];
    arr[j] = temp;
}
console.log(heapSort([1, 3, 2, 5, 4, 6, 7, 9, 8]));

10.希尔排序

function shellSort (arr) {
    let len = arr.length;
    let gap = Math.floor(len / 2);
    while (gap > 0) {
        for (let i = gap; i < len; i++) {
            let j = i;
            let current = arr[i];
            while (j - gap >= 0 && current < arr[j - gap]) {
                arr[j] = arr[j - gap];
                j = j - gap;
            }
            arr[j] = current;
        }
        gap = Math.floor(gap / 2);
    }
    return arr;
}
console.log(shellSort([1, 3, 2, 5, 4, 6, 7, 9, 8]));

11.计数排序

function countingSort (arr, maxValue) {
    let bucket = new Array(maxValue + 1);
    let sortedIndex = 0;
    let arrLen = arr.length;
    let bucketLen = maxValue + 1;
    for (let i = 0; i < arrLen; i++) {
        if (!bucket[arr[i]]) {
            bucket[arr[i]] = 0;
        }
        bucket[arr[i]]++;
    }
    for (let j = 0; j < bucketLen; j++) {
        while (bucket[j] > 0) {
            arr[sortedIndex++] = j;
            bucket[j]--;
        }
    }
    return arr;
}
console.log(countingSort([1, 3, 2, 5, 4, 6, 7, 9, 8], 9));

12.桶排序

function bucketSort (arr, bucketSize) {
    if (arr.length === 0) {
        return arr;
    }
    let i;
    let minValue = arr[0];
    let maxValue = arr[0];
    for (i = 1; i < arr.length; i++) {
        if (arr[i] < minValue) {
            minValue = arr[i];
        } else if (arr[i] > maxValue) {
            maxValue = arr[i];
        }
    }
    let DEFAULT_BUCKET_SIZE = 5;
    bucketSize = bucketSize || DEFAULT_BUCKET_SIZE;
    let bucketCount = Math.floor((maxValue - minValue) / bucketSize) + 1;
    let buckets = new Array(bucketCount);
    for (i = 0; i < buckets.length; i++) {
        buckets[i] = [];
    }
    for (i = 0; i < arr.length; i++) {
        buckets[Math.floor((arr[i] - minValue) / bucketSize)].push(arr[i]);
    }
    arr.length = 0;
    for (i = 0; i < buckets.length; i++) {
        insertionSort(buckets[i]);
        for (let j = 0; j < buckets[i].length; j++) {
            arr.push(buckets[i][j]);
        }
    }
    return arr;
}
function insertionSort (arr) {
    let len = arr.length;
    let preIndex, current;
    for (let i = 1; i < len; i++) {
        preIndex = i - 1;
        current = arr[i];
        while (preIndex >= 0 && arr[preIndex] > current) {
            arr[preIndex + 1] = arr[preIndex];
            preIndex--;
        }
        arr[preIndex + 1] = current;
    }
    return arr;
}
console.log(bucketSort([1, 3, 2, 5, 4, 6, 7, 9, 8], 3));

13.基数排序

function radixSort (arr, maxDigit) {
    let mod = 10;
    let dev = 1;
    let counter = [];
    for (let i = 0; i < maxDigit; i++, dev *= 10, mod *= 10) {
        for (let j = 0; j < arr.length; j++) {
            let bucket = parseInt((arr[j] % mod) / dev);
            if (counter[bucket] == null) {
                counter[bucket] = [];
            }
            counter[bucket].push(arr[j]);
        }
        let pos = 0;
        for (let j = 0; j < counter.length; j++) {
            let value = null;
            if (counter[j] != null) {
                while ((value = counter[j].shift()) != null) {
                    arr[pos++] = value;
                }
            }
        }
    }
    return arr;
}
console.log(radixSort([1, 3, 2, 5, 4, 6, 7, 9, 8], 1));