用折半算法查找一个排序数组

找出数组中的对应值，返回其索引，查询不到则返回－1
public class TestFind {

 /**
  * @param args
  */
 private static int find(int[] a, int value){
  int min=1;
  int max=a.length;
  int mid;
  while(min<=max){
   mid=(min+max)/2;
   System.out.println("min:"+min+" mid:"+mid+" max:"+max);
   if(a[mid-1]>value){
    max=mid-1;
   }else if(a[mid-1]<value){
    min=mid+1;
   }else{
    return mid-1;
   }
  }
  return -1;

 }
 public static void main(String[] args) {
  // TODO Auto-generated method stub
  int[] a={-10,-9,-5};
  System.out.println(find(a,-9));
 }

}