JS 快排

arr = [2,5,6,2,3,4,1];

findMin = function(arr,k){
  	
    return arr;
  }

quickSort = function(arr){
    if (arr.length <= 1) {
    return arr;
  }
  let arrLow=[],arrHigh=[],mid,midIndex;
  midIndex = Math.floor(arr.length/2);
  mid = arr[midIndex];
  arr.splice(midIndex,1)[0];
  
  for(let i=0;i<arr.length;i++){
    if(arr[i]<mid){
      arrLow.push(arr[i]);
    }else{
      arrHigh.push(arr[i]);
    }
  }
    return quickSort(arrLow).concat(mid,quickSort(arrHigh));

}
console.log(arr);
console.log(quickSort(arr))
console.log(arr);