Selection sort Algorithm

Full implementation of this algorithm is shown below.

function quickSort(arr) {
    if (arr.length <= 1) return arr;

    let pivot = arr[Math.floor(arr.length / 2)];
    let left = arr.filter(x => x < pivot);
    let right = arr.filter(x => x > pivot);

    return [...quickSort(left), pivot, ...quickSort(right)];
}