一 概述
二分查找是一种查询效率非常高的查找算法 又称折半查找
二 条件
查找内容需满足:
1.为顺序结构
2 必须按关键字大小有序排列
优点是比较次数少,查找速度快,平均性能好;
其缺点是要求待查表为有序表,且插入删除困难。
因此,折半查找方法适用于不经常变动而查找频繁的有序列表
二 代码实现
2.1 递归实现
public class TestMId {
public static void main(String[] args) {
// TODO Auto-generated method stub
int [] arrays= {72,24,53,575,866,2,64};
Arrays.sort(arrays);
System.out.println(Arrays.toString(arrays));
binarySearch(arrays, 0, 0, 0);
}
private static int binarySearch(int []arr,int key,int low,int high) {
// TODO Auto-generated method stub
if(key<arr[low] ||key >arr[high] ||low >high) {
return -1;
}
int mid=(low+high)/2;
if(arr[mid]>key) {
return binarySearch(arr,key,low,mid-1);
}else if(arr[mid]<key) {
return binarySearch(arr,key,mid+1,high);
}
return mid;
}
}
结果:
[2, 24, 53, 64, 72, 575, 866]
2.2 非递归实现
public class TestBinSearch {
public static void main(String[] args) {
int index[]= {324,64,86,97,2,1,24,54};
Arrays.sort(index);
System.out.println(Arrays.toString(index));
binsearch(index, 0);
}
private static int binsearch(int index[],int key) {
// TODO Auto-generated method stub
int low=0;
int high=index.length-1;
int mid=0;
if(key<index[low] || key>index[high] ||low >high) {
return -1;
}
while(low<=high) {
mid=(low+high)/2;
if(index[mid]>key) {
high=mid-1;
}else if(index[mid]<key) {
low=mid+1;
}else {
return mid;
}
}
return -1;
}
}
[1, 2, 24, 54, 64, 86, 97, 324]