java版折半查找法
2019-07-03 本文已影响0人
无羡爱诗诗
折半查找算法实现：
public int BinSrarch1(int arrs[], int key) {
int low =0, high =arrs.length -1, mid;
while(low <=high) {
mid = (low +high)/2;
if(key ==arrs[mid])
return mid;
else if(key >arrs[mid]) {
low =mid +1;
}
else if(key
high =mid -1;
}
}
return -1;
}
关于查找： https://www.cnblogs.com/yw09041432/p/5908444.html 大牛的博客地址
