JS 快排、冒泡排序

快排

	let arrData = [1,4,2,6,7,2,23,675,32,54]
    function quickSort(arr){
      if(arr.length <= 1) return arr
      let spliceIndex = Math.floor(arr.length/2)
      let spliceItem = arr.splice(spliceIndex,1)
      let left = []
      let right = []
      for(var i=0;i<=arr.length-1;i++){
        if(arr[i]<spliceItem){
          left.push(arr[i])
        }else {
          right.push(arr[i])
        }
      }
      return quickSort(left).concat(spliceItem, quickSort(right))
    }
    console.log(quickSort(arrData))

冒泡排序

function sortArr(arr) {
  var flag = true
  //外层for循环控制趟数
  for (var i = 0; i < arr.length - 1; i++) {
  //内层for循环两两对比
    for (var j = 0; j < arr.length - 1 - i; j++) {
      var temp
      if (arr[j] > arr[j + 1]) {
        temp = arr[j + 1]
        arr[j + 1] = arr[j]
        arr[j] = temp
        flag = false
      }
    }
    if (flag) break
  }
  return arr
}
console.log(sortArr(arr))