Function partition

chapter10/sortingAlgos/quickSort.js:10–29

(array, left, right)

};

const partition = (array, left, right) => {
  const pivotIndex = Math.floor((left + right) / 2);
  const pivot = array[pivotIndex]; 
  while(left <= right) {
    while(array[left] < pivot) {
      left++;
    }
    while(pivot < array[right]) {
      right--;
    }
    if (left <= right) {
      console.log(`swap ${array[left]} and ${array[right]}`);
      swap(array, left, right);
      console.log(array);
      left++;
      right--;
    }
  }
  return left;
};

const quickSort = (array, left, right) => {
  const index = partition(array, left, right);