/**
* 对一个从小到大排序且不重复数据的数组,可用二分查找法找出目标值的下标,
* 时间复杂度是o(logn),即log2n,比如数组长度n是16,则log2n等于4(2的4次方等于16),代表最多查找4次就能找到
*/
public class Test {
public static void main(String[] args) {
System.out.println(find(new int[]{1,2,3},3));//输出2
System.out.println(find(new int[]{1,2,3,4,5},4));//输出3
}
public static int find(int[] array, int value){
int start = 0;
int end = array.length - 1;
while (start <= end) {
int middle = (start + end) / 2;
if (array[middle] > value) {
end = middle - 1;
} else if(array[middle] < value) {
start = middle + 1;
} else {
return middle;
}
}
return -1;
}
}