Function sort

Array/KthLargestElementInAnArray.js:8–34

(arr)

// 写了个快排和归并。
 function sort(arr) {
    // 快排
    if (arr.length === 0) {
        return arr
    }

    // 选种
    let bean = Math.floor((arr.length-1) / 2)
    let base = arr[bean]
    let bigger = []
    let smaller = []

    for (let [index, item] of arr.entries()) {
        if (index === bean) {
            continue
        }

        if (item >= base) {
            bigger.push(item)
        } else {
            smaller.push(item)
        }
    }

    return [...sort(smaller), base, ...sort(bigger)]

}

// 归并
function split(arr) {