![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
Javascript
Here_Endless
这个作者很懒,什么都没留下…
展开
-
Js快速排序
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原创 2020-11-11 10:22:00 · 156 阅读 · 0 评论 -
Js归并排序
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原创 2020-11-11 10:06:57 · 149 阅读 · 0 评论