js的七种排序

function swap(arr, i, j) {
    var temp = arr[i];
    arr[i] = arr[j];
    arr[j] = temp;
}

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

function selectionSort(arr) {
    for (let i = 0; i < arr.length; i++) {
        var min = i;
        for (let j = i + 1; j < arr.length; j++) {
            if (arr[j] < arr[min]) {
                min = j;
            }
        }
        if (min !== i) {
            swap(arr, min, i);
        }
    }
    return arr;
}

/**
 * 插入排序
 * @param arr
 * @returns {*}
 */
function insertSort(arr) {
    for (let i = 1; i < arr.length; i++) {
        var temp = arr[i];
        for (var j = i - 1; j >= 0 && arr[j] > temp; j--) {
            arr[j + 1] = arr[j];
        }
        arr[j + 1] = temp;
    }
    return arr;
}

function shellSort(arr) {
    var gap = 1;
    var temp, len = arr.length;
    while (gap < len / 3) {
        gap = gap * 3 + 1;
    }
    for (; gap > 0; gap = Math.floor(gap / 3)) {
        for (let i = gap; i < len; i++) {
            temp = arr[i];
            for (var j = i - gap; j >= 0 && arr[j] > temp; j -= gap) {
                arr[j + gap] = arr[j];
            }
            arr[j + gap] = temp;
        }
    }
    return arr;
}

/**
 * 快速排序 递归
 * @param arr
 */
function qSort(arr) {
    _qSort(arr, 0, arr.length - 1);
}

function _qSort(arr, left, right) {
    if (left >= right) return arr;
    var i = left, j = right, flag = left;
    while (i < j) {
        while (arr[j] >= arr[flag] && j > flag) j--;
        if (i >= j) break;
        while (arr[i] <= arr[flag] && i < j) i++;
        var temp = arr[flag];
        arr[flag] = arr[j];
        arr[j] = arr[i];
        arr[i] = temp;
        flag = i;
    }
    _qSort(arr, left, flag - 1);
    _qSort(arr, flag + 1, right);
}

function qSort2(arr) {
    if (arr.length === 1) {
        return arr;
    }
    var left = [], right = [];
    var index = Math.floor(arr.length / 2);
    var temp = arr.splice(index, 1)[0];
    for (let i = 0; i < arr.length; i++) {
        if (arr[i] <= temp) {
            left.push(arr[i]);
        } else {
            right.push(arr[i]);
        }
    }
    return qSort2(left).concat(temp, qSort2(right));
}

/**
 * 归并排序
 * @param arr
 * @returns {*}
 */
function mergeSort(arr) {
    if (arr.length <== 1) {
        return arr;
    }
    var mid = Math.floor(arr.length / 2);
    var left = arr.slice(0, mid);
    var right = arr.slice(mid);
    return merge(mergeSort(left), mergeSort(right));
}

function merge(left, right) {
    var results = [];
    while (left.length && right.length) {
        if (left[0] > right[0]) {
            results.push(right.shift());
        } else {
            results.push(left.shift());
        }
    }
    return results.concat(left, right);
}

/**
 *
 * 堆排序
 * @param arr
 */
var len;

function heapSort(arr) {
    buildMaxHeap(arr);
    for (let i = arr.length - 1; i > 0; i--) {
        swap(arr, i, 0);
        len--;
        heapify(arr, 0);
    }
    return arr;
}

function buildMaxHeap(arr) {
    len = arr.length;
    for (let i = Math.floor(len / 2) - 1; i >= 0; i--) {
        heapify(arr, i);
    }
}

function heapify(arr, i) {
    var left = 2 * i + 1;
    var right = 2 * i + 2;
    var 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);
    }
}