Quicksort

Quicksort

function quickSort (array) {
    if (array.length <= 1) {
        return array
    }

    let pivotIndex = Math.floor(array.length / 2)
    let pivotElement = array[pivotIndex]
    let leftArray = []
    let rightArray = []

    for (let i = 0; i < array.length; i++) {
        if (i === pivotIndex) continue

        if (array[i] < pivotElement) {
            leftArray.push(array[i])
        } else {
            rightArray.push(array[i])
        }
    }

    return [...quickSort(leftArray), pivotElement, ...quickSort(rightArray)]
}