A functional quicksort in Javascript

quicksort.js

// a functional quicksort in javascript
function qSort(arr) {
  if (arr.length <= 1) return arr;
  else {
    const pivPoint = Math.floor(arr.length / 2);
    const pivot = arr[pivPoint];

    const newArr = [].concat(
      qSort(arr.filter(x => x  <  pivot)),
            arr.filter(x => x === pivot),
      qSort(arr.filter(x => x  >  pivot)),
    );
    return newArr;
  }
}