pubic static boolean binarySearch (int[] list, int target)
{
boolean result=false;
int low=0, hight=list.length-1,middle;
while(low<=hight)
{
middle=(low<=high)/2;
{
if(list[middle]==target)
{
result=true;
return result;
}
else
if (list[middle]<target)
low=middle+1;
else
high=middle-1;
}
return result;
}