console.log("锋叔子的归并排序");function merge(left, right) {var result = [];while (left.length > 0 && right
console.log("锋叔子的归并排序");function merge(left, right) { var result = []; while (left.length > 0 && right.length > 0) { if (left[0] < right[0]) { result.push(left.shift()); } else { result.push(right.shift()); } } result = result.concat(left).concat(right); console.log(result); return result;}function mergeSort(items) { if (items.length === 1) { return items; } var middle = Math.floor(items.length / 2); var left = items.slice(0, middle); var right = items.slice(middle); //递归调用mergeSort，如果返回的不是结果组，而是一个函数，则继续调用 return merge(mergeSort(left), mergeSort(right));}//测试排序function testSort() { var myArray = initArray(); var tempArray = []; var myArrayAfterSort = mergeSort(myArray); for (var i = 0; i < myArrayAfterSort.length; i++) { console.log(myArrayAfterSort[i]); }}//初始化数组function initArray(){ var myArray = [9, 3, 7, 8, 4, 6, 77, 88]; return myArray;}testSort();
