【无标题】

二分查找算法的实现

public static void main(String[] args) {
//定义一个数组
int[]arr={14,36,78,20,47,50};
System.out.println(search(arr, 14));
}

private static int search(int[]arr,int data) {
    //定义左边和右边的索引
    int left=0;
    int right=arr.length-1;

    //二分查找代码实现
    while (left<=right){
        int mid=(left+right)/2;
        if (data>arr[mid]){
            left=mid+1;
        } else if (data<arr[mid]) {
            right=mid-1;

        }else {
            return mid;
        }
    }
    return -1;
}