二分递归查找和非递归查找

public int binarySearch(int elem,int [] array,int low,int high){
if(low>high){
return -1;
}
int middle = (low+high)/2;
if(array[middle] == elem){
System.out.println("找到对应元素值，下标为："+middle);
return middle;
}
if(array[middle]<elem){
//找右边
return binarySearch(elem, array, middle+1, high);
}
if(array[middle]>elem){
//找左边
return binarySearch(elem, array, low, middle-1);
}
return -1;

}

/**
* @param args
*/
public int directBinarySearch(int[] array,int elem){
int low = 0;
int high = array.length-1;
while(low<=high){
int middle = (low+high)/2;
if(elem>array[middle]){
//右边找
low = middle+1;
}else  if(elem<array[middle]){
high = middle - 1;
}else{
System.out.println("找到相应元素，下标为："+middle);
return middle;
}
}
return -1;
}