手写数组的冒泡排序和

let arr = [2, 4, 3, 6, 5]
// 冒泡排序
function sort (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]) {
var temp = arr[j]
arr[j] = arr[j+1]
arr[j+1] = temp
}
}
}
return arr
}
console.log(sort(arr));

    // 快速排序（递归）
    function quickSort (arr) {
        if (arr.length <= 1) {
            return arr
        }
        let index = Math.floor(arr.length / 2) //中间值的索引
        let midVal = arr.splice(index, 1) //取中间值
        let leftArr = []
        let rightArr = []
        for (let i = 0;i< arr.length;i++) {
            if (arr[i] >= midVal) {
                rightArr.push(arr[i])
            } else {
                leftArr.push(arr[i])
            }
        }
        return quickSort(leftArr).concat(midVal, quickSort(rightArr))
    }
    console.log(quickSort(arr));