Binary Search in java



public class SimpleBinarySearch {


public static  int bainry(int[] array,int key)
{

int low=0;
int high=array.length-1;
int mid=low+high/2;
if(low<=high && array[mid]!=key)

{
if(array[mid]<key)
{
low=mid+1;
}
else
{
high=mid-1;
}
mid=low+high/2;
}


return mid;

}


public static void main(String[] args)
{

int[] array={1,2,3,4,6,7,8,9};
int Searchkey=8;

System.out.println(bainry("Index number is : "+array,Searchkey));
}

}