1.前提条件:数组必须是一个有序数组
2.思路:
1)取中间值array[middle]与目标值target做比较,如果相等返回当前下标;
2)如果中间值array[middle]小于目标target值,说明目标值在中间值的右侧,设置新一轮开始下标start=middle,相当于下一轮从middle~end之间查询;
3)如果中间值array[middle]大于目标target值,说明目标值在中间值的左侧,设置新一轮结束下标end=middle,相当于下一轮从start~middle之间查询;
4)循环上面操作,会找到目标值,如果找不到返回-1
3.代码示例(时间复杂度为O(logn)):
/**
* @Author: hs
* @Description: 二分查找
* @Date: 2021-01-30 10:57
*/
public class BiSearch {
public static int biSearch(int[]array,int target){
//首先要确保当前列表是有序数组
//通过开始下标和结束下标取中间值
int left = 0;
int right = array.length-1;
if(array.length<=0||left>right||array[left]>array[right]){
return -1;
}
while (left<right){
//如果中间值=target,return
int middle = (left+right)/2;
if(array[middle]==target){
return middle;
}
//如果中间值比target小,设置right=中间下标
if(array[middle]<target){
left = middle;
}
//如果中间值比target大,设置left=中间下标
if(array[middle]>target){
right = middle;
}
}
return -1;
}
public static void main(String[] args) {
int [] array = {1,2,3,4,5,6,7,8,9};
int index = biSearch(array,6);
System.out.println(index);
}
}