quickSort in ES6 favor

quickSort.js

function quickSort(list) {
    if (list.length < 2) return list

    let medIdx = Math.floor(list.length / 2),
        medItem = list[medIdx],
        newList = [...list.slice(0, medIdx), ...list.slice(medIdx+1)],
        left = newList.filter(item => item <= medItem),
        right = newList.filter(item => item > medItem)

    return [...quickSort(left), medItem, ...quickSort(right)]
}