java给定一个有序整型数组, 实现二分查找

public class Test44{
    public static void main(String[] args){
        int[] arr={1,2,3,4,5,6,7,8,9,10};
        int ret=find(arr,9);
        System.out.println(ret);
    }
    public static int find(int[]arr1,int tofind){
        int left=0;
        int right=arr1.length-1;
        while(left<=right){
            int mid=(left+right)/2;
        if(tofind<arr1[mid]){
            right=mid-1;
        }else if(tofind>arr1[mid]){
            left=mid+1;
        }else{
            return mid;
        } 
    }   
        return -1;
 }
}
发布了87 篇原创文章 · 获赞 2 · 访问量 709

猜你喜欢

转载自blog.csdn.net/Nabandon/article/details/103764423