快速排序

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