JS实现选择排序和快速排序

// 快速排序
function quickSort(arr) {
    if (arr.length <= 1) {
        return arr;
    }
    //设置哨兵的位置
    let mid = Math.floor(arr.length / 2);
    let midValue = arr.splice(mid, 1)[0];
    midValue
    //定义两个左右数组
    let leftArr = [];
    let rightArr = [];
    for (let item of arr) {
        if (item < midValue) {
            leftArr.push(item);
        } else {
            rightArr.push(item);
        }
    }
    return quickSort(leftArr).concat(midValue, quickSort(rightArr));
};

console.log(quickSort([32, 435, 213, 2, 32, 321, 4, 7, 54]));


// 选择排序
function findSort(arr) {
    for (let i = 0; i < arr.length; i++) {
        let value = MidFindSort(arr, i);
        let item = arr[i];
        arr[i] = arr[value];
        arr[value] = item;
    }
    return arr;
}

function MidFindSort(arr, index) {
    let midindex = index;
    let midindexValue = arr[index];
    for (let i = index; i < arr.length; i++) {
        if (midindexValue > arr[i]) {
            midindex = i;
            midindexValue = arr[i];
        }
    }
    return midindex
}
console.log(findSort([32, 435, 213, 2, 32, 321, 4, 7, 54]));