java实现有序数组的折半查找

public class BinarySearch {
public int search(int[] arr,int data){
if(arr==null || arr.length==0)
return -1;
int low=0;
int high=arr.length-1;
int mid=0;
while(low <=high){
mid =(low+high)/2;
if(arr[mid]==data)
return mid;
else if(arr[mid]>data)
high=mid-1;
else
low=mid+1;
}
return -1;
}
}