java-二分查找法

package search;

public class BinarySearch {
    public static void main(String[] args) {
        int[] arys = {1, 3, 6, 11, 35, 36, 45, 66, 75};
        System.out.println(binarySearch(arys, 6, 0, arys.length - 1));
    }

    private static int binarySearch(int[] arys, int element, int begin, int end) {
        // TODO Auto-generated method stub
        if (begin <= end) {
            int mid = (begin + end) >> 1;
            if (arys[mid] == element)
                return mid;
            else if(arys[mid] > element) {
                return binarySearch(arys, element, 0, mid - 1);
            } else {
                return binarySearch(arys, element, mid + 1, end);
            }
        } else
        return -1;
    }
}

 

转载于:https://www.cnblogs.com/jerry19890622/p/3282859.html