折半查找 //前提:被查找的数组必须是有序的 public static int Findinhalf(int[] a,int x){ int min = 0; int max = a.length-1; int mid = 0; while(min <= max){ mid = (min+max)/2; if(a[mid] < x){ min = mid + 1; } else if(a[mid] > x) { max = mid - 1; } else{ return mid; } } return -1; }