随便啦

 public class TestSearch {
 public static void main(String[] args) {
  int a[] = { 1, 3, 6, 8, 9, 10, 12, 18, 20, 34 };
  int i = 12;
  //System.out.println(search(a, i));
  System.out.println(binarySearch(a, i));
 }
 
 public static int search(int[] a, int num) {
  for(int i=0; i<a.length; i++) {
   if(a[i] == num) return i;
  }
  return -1;
 }
 
 public static int binarySearch(int[]a, int num) {
    if (a.length==0) return -1;
   
    int startPos = 0;
    int endPos = a.length-1;
    int m = (startPos + endPos) / 2;
    while(startPos <= endPos){
      if(num == a[m]) return m;
      if(num > a[m]) {
       startPos = m + 1;
      }
      if(num < a[m]) {
       endPos = m -1;
      }
      m = (startPos + endPos) / 2;
    }
    return -1;
  }

} public static void find(int[] ar){ int i = 0; int j = 0; int temp = 0; for(i = 0;i<ar.length;i++){ for(j= i + 1;j < ar.length;j++){ if(ar[i]>ar[j]){ temp = ar[i]; ar[i] = ar[j]; ar[j] = temp; } } } } public static void findtwo(int[] ar){ int i = 0; int j = 0; int temp = 0; int k = 0; for(i = 0; i < ar.length; i++){ k = i; for(j=k+1; j < ar.length; j++){ if(ar[i]>ar[j]){ k = j; } } if(k!=i){ temp = ar[i]; ar[i] = ar[k]; ar[k] = temp; } } }