什么是二分法?
二分查找可以解决已经排好序数组(有序数组)的查找问题:
只要数组中包含target(要查找的值),那么通过将包含target的数组一分为二,判断有序数组的中位数与target的大小,来判断target属于中位数左边或右边的数组,然后将新数组(也就是刚刚判断出来的包含target的数组)一分为二,循环上述操作,不断的缩小的范围,直到找到它
用递归二分法实现array.indexOf 功能(数组为正序排列)
function indexOf(arr,target,start,end){
start = start || 0;
end = end || arr.length - 1;
if(start > end){
return -1;
}
let mid = Math.floor((start + end)/2);
if(arr[mid] > target) {
end = mid-1;
return indexOf(arr,target,start,end);
}
else if(arr[mid] < target){
start = mid + 1;
return indexOf(arr,target,start,end);
}
else {
return mid;
}
}
let a = [0,1,2,3,4,5,6,434,435];
console.log(indexOf(a,12)); //打印结果为-1
while循环实现
function indexOf(arr,target,start,end){
start = start || 0;
end = end || arr.length - 1;
let mid = Math.floor((start + end)/2);
console.log(start,end);
while(start <= end){
console.log(start,end,target,arr[mid]);
if(target > arr[mid]){
start = mid + 1;
mid = Math.floor((start + end)/2);
}
else if(target < arr[mid]){
end = mid - 1;
mid = Math.floor((start + end)/2);
}
else {
return mid ;
}
}
console.log(start,end);
return -1;
}
let a = [0,1,2,3,4,5,6,434,435];
console.log(indexOf(a,5)); //打印结果为5