Java BinarySearch

public static int Binary_Search(int[] a,int key){

    int low=0;

    int high=a.length-1;

   while(low<=high){

        int mid=(low+high)/2;

        int midVal=a[mid];

        if midVal==key

            return mid;

                else if midVal<a[mid]

                 high=mid-1;

                      else

                         low=mid+1

}

     return -1;    

}