js中Array.sort()利用零值多维排序

let arr = ["apple 55 33 11", "orange 55 40 18", "banana 33 40 15", "watermeion 33 40 17", "peach 33 40 17"]
const compareName = (a, b) => a > b ? 1 : -1
let result = arr.map(item => item.split(' ')).sort((a, b) => {
  return (+b[1]) - (+a[1]) || (+b[2]) - (+a[2]) || (+b[3]) - (+a[3]) || compareName(a[0], b[0])
})
console.log(result)
// [
//   [ 'orange', '55', '40', '18' ],
//   [ 'apple', '55', '33', '11' ],
//   [ 'peach', '33', '40', '17' ],
//   [ 'watermeion', '33', '40', '17' ],
//   [ 'banana', '33', '40', '15' ]
// ]

const insertionSort = function(callback) {
  arr = this
  const len = arr.length
  let preIndex, current
  for (let i = 1; i < len; i++) {
    preIndex = i - 1
    current = arr[i]
    while(preIndex >= 0 && (callback(current, arr[preIndex]) < 0)){
      //callback：将第i个值，和前面已排好的i-1个值进行比较
      arr[preIndex + 1] = arr[preIndex]
      preIndex--
    }
    arr[preIndex + 1] = current
  }
  return arr
}
Array.prototype.insertionSort = insertionSort

let arr = ["apple 55 33 11", "orange 55 40 18", "banana 33 40 15", "watermeion 33 40 17", "peach 33 40 17"]
const compareName = (a, b) => a > b ? 1 : -1
arr.map(item => item.split(' ')).insertionSort((a, b) => {
  return (+b[1]) - (+a[1]) || (+b[2]) - (+a[2]) || (+b[3]) - (+a[3]) || compareName(a[0], b[0])
})
console.log(arr)
// [
//   [ 'orange', '55', '40', '18' ],
//   [ 'apple', '55', '33', '11' ],
//   [ 'peach', '33', '40', '17' ],
//   [ 'watermeion', '33', '40', '17' ],
//   [ 'banana', '33', '40', '15' ]
// ]

const quickSort = function (callback) {
  let arr = this
  if (arr.length <= 1) { return arr; }
  // 获取基准值得索引
  let pivotIndex = Math.floor(arr.length / 2);
  // 获得索引值
  let pivot = arr.splice(pivotIndex, 1)[0];
  // 定义左右两个空数组
  let left = [];
  let right = [];
  // 分组
  for (let i = 0; i < arr.length; i++) {
    if (callback(arr[i], pivot) < 0) {
      left.push(arr[i]);
    } else {
      right.push(arr[i]);
    }
  }
  // 递归
  return [...left].quickSort(callback).concat([pivot], [...right].quickSort(callback));
};
Array.prototype.quickSort = quickSort