package com.wxh.maopao;
//二分查找
import java.util.Arrays;
public class find2 {
/**
* @param args
*/
public static void main(String[] args) {
int[] arr={1,2,3,4,5,6,7,8,9};
find2(arr,9);
}
private static void find2(int[] arr,int num) {
int start=0;
int end=arr.length-1;
int sign=-1;
while(start<=end){
int middle=(start+end)/2;
if(arr[middle]>num){
end=middle-1;
}else if(arr[middle]<num){
start=middle+1;
}else{
sign=middle;
break;
}
}
System.out.println(sign);
}
}
Java二分查找算法
最新推荐文章于 2023-08-08 10:58:14 发布