java – 二进制搜索不适用于双打

public class binarySearchProject
{
  public static int binarySearch(double[] arr,double x,int high,int low)
  {
    int mid=(high+low)/2;
    if(high==low || low==mid || high==mid)
    {
      return -1;
    }
    if(arr[mid]>x)
    {
      return binarySearch(arr,x,high,mid);
    }
    else if(arr[mid]<x)
    {
      return binarySearch(arr,mid,low);
    }
    else if(arr[mid]==x)
    {
      return mid;
    }
    return -1;
  }
  public static void main(String args[])
  {
    double i = 45.3;
    double[] a = {-3,10,5,24,45.3,10.5};
    int size = a.length;
    System.out.println(binarySearch(a,i,size,0));
  }
}