查找某个数是否在数组中,若存在,则返回所在的下标。[前提是数组已排序]
public static int binarySearch(int[] arr,int key){
int min = 0;
int max = arr.length-1;
int mid;
while(min <= max){
mid = min + ((max-min)>>1); //防止溢出,移位也更高效
if(key>arr[mid])
min = mid+1;
else if(key<arr[mid])
max = mid-1;
else
return mid;
}
return -1;
}
二分查找在一个有序序列中的时间复杂度为O(logn)