前端之算法（四）快速排序

Array.prototype.quickSort = function () {    const rec = arr => {        if (arr.length === 1) return        const left = []        const right = []        const mid = arr[0]        for (let i = 1; i < arr.length; i++) {            if (arr[i] < mid) {                left.push(arr[i])            } else {                right.push(arr[i])            }        }        return [...rec(left), mid, ...rec(right)]    }    const res = rec(this)    res.forEach((n, i) => { this[i] = n })}const arr = [3, 44, 38, 5, 47, 15, 36, 26, 27, 2, 46, 4, 19, 50, 48]arr.quickSort()console.log(arr);// [   2,  3,  4,  5, 15, 19,  26, 27, 36, 38, 44, 46,  47, 48, 50]