二分查找法是对一组有序的数字中进行查找
方法1 非递归写法
function test1(array, a) {
var low = 0,
mid,
height;
height = array.length - 1;
while (low <= height) {
// mid=Math.ceil((height+low)/2);
mid = low + ((height - low) >> 1); 和上面的效果都是一样的
if (a == array[mid]) {
return mid;
} else if (a < array[mid]) {
height = mid - 1;
} else {
low = mid + 1
}
}
return -1;
}
方法2 递归写法
function test2(array,low,height,key){
if(low<=height){
// let mid= Math.ceil((height+low)/2);
let mid = low +((height-low)>>1);
if(key == array[mid]){
return mid;
}else if(key < array[mid]){
return test2(array,low,mid-1,key);
}else{
return test2(array,mid+1,height,key);
}
}else{
return -1;
}
}
测试
var arry = [1, 2, 4, 6, 7, 9, 11, 13, 14, 17, 18, 19, 20, 21, 22, 24, 27, 30, 31, 33, 35];
console.log('下标为1=',test1(arry, 30));
console.log('下标为2=',test2(arry,0,arry.length-1,30));