JavaScript实现排序算法

闲着无聊写了下JavaScript的各大排序算法，也算是对自己学习JavaScript语法的一个小小练习。不多说，上代码。

1、冒泡排序

// 冒泡排序
function bubbleSort(arr) {
    let i, j, temp;
    for (i = 0; i < arr.length; i++) {
        for (j = 0; j < arr.length - i - 1; j++) {
            if (arr[j] < arr[j + 1]) {
                temp = arr[j];
                arr[j] = arr[j + 1];
                arr[j + 1] = temp;
            }
        }
    }
    return arr;
}

2、简单选择排序

// 简单选择排序
function selectSort(arr) {
    let i, j, temp, min_index;
    for (i = 0; i < arr.length; i++) {
        min_index = i;
        for (j = i; j < arr.length; j++) {
            if (arr[j] < arr[min_index]) {
                min_index = j;
            }
        }
        temp = arr[i];
        arr[i] = arr[min_index];
        arr[min_index] = temp;
    }
    return arr;
}

3、直接插入排序

// 直接插入排序
function insertionSort(arr) {
    let i, j, temp;
    for (i = 1; i < arr.length; i++) {
        j = i;
        while (j > 0) {
            if (arr[j] < arr[j - 1]) {
                temp = arr[j];
                arr[j] = arr[j - 1];
                arr[j - 1] = temp;
            }
            j -= 1;
        }
    }
    return arr;
}

4、希尔排序

// shell排序
function shellSort(arr) {
    let i, j, gap, temp;
    gap = Math.floor(arr.length / 2);
    while (gap > 0) {
        for (i = gap; i < arr.length; i++) {
            j = i;
            while (j > gap - 1) {
                if (arr[j] > arr[j - gap]) {
                    temp = arr[j];
                    arr[j] = arr[j - gap];
                    arr[j - gap] = temp;
                }
                j -= gap;
            }
        }
        gap = Math.floor(gap / 2);
    }
    return arr;
}

5、堆排序

// 堆排序调用函数
function heapify(arr, n, i) {
    let temp;
    let largest = i;
    let left = i * 2 + 1;
    let right = i * 2 + 2;
    if (left < n && arr[left] > arr[largest]) {
        largest = left;
    }
    if (right < n && arr[right] > arr[largest]) {
        largest = right;
    }
    if (i !== largest) {
        temp = arr[i];
        arr[i] = arr[largest];
        arr[largest] = temp;
        heapify(arr, n, largest);
    }
}

// 堆排序
function heapSort(arr) {
    let i, temp;
    for (i = arr.length; i >= -1; i--) {
        heapify(arr, arr.length, i);
    }
    for (i = arr.length - 1; i >= 0; i--) {
        temp = arr[0];
        arr[0] = arr[i];
        arr[i] = temp;
        heapify(arr, i, 0);
    }
    return arr;
}

6、归并排序

// 归并排序调用函数
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;
}

// 归并排序
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, arr.length);
    let arr_l = mergeSort(left);
    let arr_r = mergeSort(right);
    return merge(arr_l, arr_r);
}

7、快速排序

/**
 * 快排 调用时，arr仍为数组，参数low=0,high=arr.length-1
 * @param arr
 * @param left
 * @param right
 * @returns {*}
 */
function quickSort(arr, low, high) {
    if (low < high) {
        let i = low, j = high, key = arr[low];
        while (i < j) {
            while (i < j && arr[j] > key) {
                j -= 1;
            }
            arr[i] = arr[j];
            while (i < j && arr[i] < key) {
                i += 1;
            }
            arr[j] = arr[i];
        }
        arr[i] = key;
        quick_sort(arr, low, i - 1);
        quick_sort(arr, i + 1, high);
    }
    return arr;
}