public class VarDemo
{
static int binarySearch(int[] arr,int key)
{
int low = 0;//数组最小的索引
int high = arr.length - 1;//数组中最大的索引
while(low < high)
{
int mid = (low + high) >> 1;
int midVal = arr[mid];
if(midVal < key)
{
low = mid - 1;
}
else if(low > high)
{
high = mid + 1;
}
else
{
return mid;
}
}
return -1;
}
public static void main(String[] args)
{
int[] arr1 = {1,2,3,4,5,6,7,8};
VarDemo.binarySearch(arr1,6);
int result=binarySearch(arr1,6);
System.out.println(result);
}
}