[JS] QuickSort Algorithm with random array

qsort.js

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

  const left = [];
  const right = [];
  const pivot = array.pop();

  for (let i = 0; i < array.length; i++) {
    if (array[i] < pivot) {
      left.push(array[i]);
    } else {
      right.push(array[i]);
    }
  }

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

function generateArray() {
  const array = [];
  for (let i = 0; i < Math.floor(Math.random() * 10 + 2); i++) {
    array.push(Math.floor(Math.random() * 20));
  }
  return Array.from(new Set(array));
}

for (let i=0 ; i<200 ; i++) {
  console.log(qsort(generateArray()));
}