大数据必会算法之二分查找

package search;

/**
 * Copyright (c) 2019 bigdata ALL Rights Reserved
 * Project: learning
 * Package: search
 * Version: 1.0
 *
 * @author qingzhi.wu 2020/8/27 18:07
 */
public class BinarySearch {
    public static void main(String[] args) {
        int target = 6;
        int[] arr = {1,2,3,4,5,6,7,8,9};
        int index = contains(arr,target);
        System.out.println("index:  "+index);
    }

    private static int contains(int[] arr, int target) {
        int left = 0;
        int right = arr.length -1;
        while (left<=right){
    
            int mid = left+(right-left)/2;
            if (arr[mid]== target){
                return mid;
            }else if (arr[mid] <= target){
                left = mid+1;
            }else if (arr[mid] >= target){
                right = mid -1;
            }
        }
        return -1;
    }
}