用递归实现二分查找 JAVA

package AlgorithmTest;

import java.util.Arrays;

/**
* Created by dell on 2015/10/1.
*/
public class BinarySearchWithRecusionTest {
public static void main(String[] args) {
int[] array = new int[]{9,8,7,6,5,4,3,2,1};
Arrays.sort(array);
System.out.println(binarySearchWithRecusion(array, 8));
System.out.println(binarySearchWithRecusion(array, 10));
}

public static int binarySearchWithRecusion(int[] array,final int findData){
if (null != array && 0 != array.length){
return binarySearchWithRecusionUnit(array, findData, 0, array.length);
}

return -1;
}

public static int binarySearchWithRecusionUnit(int[] array, final int findData, int begin, int end)
{
if (begin < end){
int mid = (begin + end) / 2;
if (findData == array[mid]){
return mid;
}else{
if (findData > array[mid]){
return binarySearchWithRecusionUnit(array, findData, mid + 1, end);
}else{
return binarySearchWithRecusionUnit(array, findData, begin, mid - 1);
}
}
}else{
return -1;
}
}
}