算法2，用递归的模式实现二分查找

public class binaryRecursion {

 public static int find (int [] nums, int start, int end,int num)
 {
  int mid = (start+end)/2;
  int result = -1;
  if ((start >= end) )
  {
   System.out.println("not found");
   return -1;
  }
  if(nums[mid] == num)
  {
   return mid;
  }else if( nums[mid] > num)
  {
   result =  find(nums, start, mid-1, num);
  }else if( nums[mid] < num )
  {
   result = find(nums, mid+1, end, num);
  }
  return result;
 }
 
 public static void main(String [] args)
 {
  int [] nums = {-1, 0, 4, 7, 8, 9, 34, 90};
  int num = 80;
  System.out.println(binaryRecursion.find(nums, 0, nums.length, num));
 }
}