二分搜素

public class Main {

    public static void main(String[] args) {
        int []list = {1, 3, 5, 2, 4, 7, 9, 6};
        Arrays.sort(list);
        for (int l: list) {
            System.out.print(l + " ");
        }
        System.out.println(binarySearch(list, 9, list.length));
    }

    private static int binarySearch(int []list, int x, int n){
        int left = 0;
        int right = n - 1;
        while(left <= right){
            int middle = (left + right) / 2;
            if(list[middle] == x){
                return middle;
            }
            if(list[middle] > x){
                right = middle -1;
            }else{
                left = middle + 1;
            }
        }
        return -1;
    }
}