比较无聊,所以在chrome下的控制台里测试这个代码
function binSearch(arr,dst){
var l = 0,
r=arr.length-1;
//遍历数组
while(l <= r){
var m = (l+r)>>1;//一分为二
//目标在前半段(0~m-1)
if(dst
//目标在后半段(m+1~r)
else if(arr[m]
else{
//输出结果
//添加一个判断,确保取到的是第一个目标
if(arr[m-1]==dst){return m-1;}
return m;
}
}
//目标不在数组中
return -1;
}
function normalSearch(arr,dst) {
for(var i=0, l=arr.length;i
if(arr[i] == dst) {
return i;
}
}
}
var arr = [];
for(var i=0;i<10000;i++){
arr.push(i*3);
}
var arr2 = [1, 2, 4, 6, 7, 9, 19,20, 30, 40, 45, 47,48,49,50,60,80,90,111,122,144,155,166,177,211,222,223,333,444,555,666,777];
console.time("binary search");
for(var i=0;i<100000;i++){
binSearch(arr, 1665);
}
console.timeEnd("binary search");
console.time("normal search");
for(var i=0;i<100000;i++){
normalSearch(arr, 1665);
}
console.timeEnd("normal search");
console.time("binary search");
for(var i=0;i<100000;i++){
binSearch(arr2, 777);
}
console.timeEnd("binary search");
console.time("normal search");
for(var i=0;i<100000;i++){
normalSearch(arr2, 777);
}
console.timeEnd("normal search");
输出
binary search: 4.886962890625ms
normal search: 35.634033203125ms
binary search: 3.026123046875ms
normal search: 4.693115234375ms
现在看起来二分法的效率已经超过遍历了,所以应该是除法取整这个过程导致了二分法搜索效率的降低