折半查找java

package seek;
public class BinarySearch {
    public static void Main(int[] a,int key) {
        int low=0,high=a.length-1,mid ;
        while (low<=high){
            mid=(low+high)/2;
            if(key==a[mid]){
                System.out.println(a[mid]+"--->"+mid);
                break;
            }
            else if(key<a[mid]){
                high=mid-1;
            }
            else {
                low =mid+1;
            }
        }
    }

    public static void main(String[] args) {
        int[] a= new int[]{1,2,3,4,5,0};
        BinarySearch.Main(a,11);
    }

}