qq_49247218的博客

var array = [1, 2, 3, 4, 5, 6]; function search(array, target) { let left = 0; let right = array.length - 1; let middle; while (left <= right) { // Math.floor向下取整 middle = Math.floor(left + (right - left) / 2); // 防止栈溢出 if (array[mi.

function selectionSort(arr) { function exchange(v1, v2) { let temp = arr[v1] arr[v1] = arr[v2] arr[v2] = temp } let length = arr.length for(let i = 0; i < length - 1; i++) { let min = i //获取遍历的每一项索引.

function bubbleSort(arr) { // 两个数据进行交换 function exchange(v1, v2) { let temp = arr[v1] arr[v1] = arr[v2] arr[v2] = temp } // 数组长度 let length = arr.length for (let i = length - 1; i >= 0; ...