二分法查找JAVA实现

public class Main {

public static void main(String[] args) {
double[] L=new double[100];
for(int i=0;i<L.length;i++)
L[i]=i+1;
System.out.println(new 二分法查找().search(L, 0, L.length, 51));
}

int search(double[] L,int a,int b, double x){
if(a > b)
return -1;
else{
int m = (a+b)/2;
if(L[m] == x)
return m;
else if(L[m] > x)
return search(L, a, m-1, x);
else
return search(L, m+1, b, x);
}
}
}