fantastic的博客

三个排序思想，这种二分通过递归方式是，不可取的，作为思路 var quickSort = function (arr) { if (arr.length <= 1) { return arr; } // if (arr.length === 2) { return arr[0] > arr[1] ? arr : [arr[1], arr[0]] } var pivot = arr.splice(0, 1)[0]; var left = []; var right = [];

let n = 5, bad = 4; let i = 0, j = n; let index = 0 while (i <= j) { index++ const o = Math.floor((j + i) / 2) if (o < bad) { i = o + 1 } else if (o === bad) { console.log(index + 1); break } else .

插入排序思想： let nums1 = [1, 2, 3, 0, 0, 0], m = 3, nums2 = [2, 2, 4], n = 3 let nl1 = m; for (let i = 0; i < n; i++) { let pre = nums2[i] let n = nl1 while (n > 0 && nums1[n - 1] > pre) { nums1[n] = nums1[n - 1] n--