Here_Endless的博客

const swap = (arr, i, j) => { const temp = arr[i] arr[i] = arr[j] arr[j] = temp } // 获取 pivot 交换完后的index const partition = (arr, pivot, left, right) => { const pivotVal = arr[pivot] let startIndex = left for (let i = left; i

const mergeArr = (left, right) => { let temp = [] let leftIndex = 0 let rightIndex = 0 // 判断2个数组中元素大小，依次插入数组 while (left.length > leftIndex && right.length > rightIndex) { if (left[leftIndex] <= right[rightIn