二分查找

public class test {
    public static int binSearch1(int[] array,int key)
    {
        int start=0;
        int end=array.length-1;
        int mid;

        while(start<=end)
        {
            mid=(start+end)/2;
            if(key<array[mid])
            {
                end=mid-1;
            }
            else if(key>array[mid])
            {
                start=mid+1;
            }
            else
            {
                return mid;
            }
        }
        return 0;
    }
    public static void main(String[] args) {
        int[] a1=new int[]{1,2,3,4,5};
        System.out.println(binSearch1(a1,4));

}}