A Rather Easy Way to Implement Quicksort in JavaScript

function quickSort(arr) {
  if (arr.length <= 1) return arr;
  else {
    let pivot = arr.pop();
    let len = arr.length;
    let left = [];
    let right = [];
    for (let i = 0; i < len; i++) {
      if (arr[i] >= pivot) right.push(arr[i]);
      else left.push(arr[i]);
    }
    return [...quickSort(left), pivot, ...quickSort(right)];
  }
}