LeetCode 75 Quick Sort in place

leetCode75.js

//use space
var sortColors1 = function(nums) {
    const pivot = nums[0];
    let left = [];
    let right = [];
    let i = 0;
    while(i < nums.length -1) {
      nums[i] < pivot ? left.push(nums[i]) : right.push(nums[i])
      i++;
    }
  return [...left,pivot,...right]
};

//native sort in js used quick sort when less data
var sortColorsNativeSort = (nums) => {
  nums.sort((a,b) => a - b)
}

//implement quick sort in place 
var swap = (list,a,b) => [list[a],list[b]] = [list[b],list[a]]
var getPointer = (nums,start,end) => {
  const v = nums[start];
  let pointer = start;
  for(let i = start + 1; i < end ; i++){
    if(nums[i] < v){
      pointer++;
      swap(nums,pointer,i);
    }
  }
  swap(nums,start,pointer)
  return pointer
}
const sortColors = (nums,start = 0,end = nums.length) => {
   if(start >= end) return
  const p = getPointer(nums,start,end)
 
  sortColors(nums, start, p)
  sortColors(nums, p+1, end)
}

const nums = [2,1,4,3,7,1,8]
sortColors(nums)
console.log(nums)