二分查找

/**
 * @author zjq
 * @date 2020/6/30 18:22
 */
public class Demo {
    public static void main(String[] args) {
        int arr[] = {1,8,10,89,1000,1234};
        int index = BinarySearch(arr,0,arr.length-1,8);
        System.out.println(index);
    }

    /**
     * 二分查找
     * @param arr 待 二分的数组
     * @param left 数组的左边界
     * @param right 数组的右边界
     * @param findVal 待查找的值
     * @return
     */
    public static int BinarySearch(int[] arr,int left,int right,int findVal){
        while (left<=right){
            int mid = (left+right)/2;
            System.out.println("左边界 "+arr[left]+"中间值 "+arr[mid]+"右边界 "+arr[right]);
            int midVal = arr[mid];
            if(findVal == midVal){
                return mid;
            }else if (findVal > midVal){
                return BinarySearch(arr,mid+1,right,findVal);//查找左数组
            }else{
                return BinarySearch(arr,left,mid-1,findVal);//查找右数组
            }
        }
        return -1;
    }
}