Array.prototype.quickSort = function () {
    const rec = (arr) => {
	    //对空数组进行检验
        if (arr.length === 0) return arr
        if (arr.length === 1) return arr
        const small = []
        const big = []
        const mid = arr[0]
        for (let i = 1; i < arr.length; i++) {
            if (arr[i] < mid) {
                small.push(arr[i])
            } else {
                big.push(arr[i])
            }
        }
        return [...rec(small), mid, ...rec(big)]

    }
    const res = rec(this)
    res.forEach((item, index) => this[index] = item)
}