参考书籍：《学习JavaScript数据结构与算法》第三版

function mergeSort(array) {if(array.length>1) {const {length} = array;const mid = Math.floor(length/2);const left = mergeSort(array.slice(0, mid));const right = mergeSort(array.slice(mid, length));array = merge(left,right) } return array;}/*@params:  left: 左侧的数组；right: 右侧的数组@return: 合并和排序小数组，返回大数组，直到回到原始数组并已排序完成 */function merge(left ,right) {let i= 0;let j= 0;let result = [];while(i < left.length && j<right.length) {result.push(left[i] < right[j] ? left[i++] : right[j++]);}return result.concat(i<left.length ? left.slice(i) : right.slice(j));}console.log(mergeSort([11,21,23,13,24,25,24]));