# 快速排序（快排）

  function quickSort(arr){
    if(arr.length <= 1){
      return arr
    }
    let current = arr[0]
    let left = []
    let right = []
    for (let index = 1; index < arr.length - 1; index++) {
      if(current>=arr[index]){
        left.push(arr[index])
      }else{
        right.push(arr[index])
      }
    }
    return [...quickSort(left), current, ...quickSort(right)]
  }