Serach

1.二分查找

 1 public class BubbleSort {  2     public static int binarySerach(int[] a,int value){  3         int low=0;  4         int high=a.length-1;  5         int min=(low+high)/2;  6         while(low<=high){  7             if(value==a[min]){  8                 return min;  9  } 10             if(value>a[min])    low=min+1; 11             else    high=min-1; 12             min=(low+high)/2; 13  } 14         return -1; 15  } 16     
17     public static void main(String[] args){ 18         int[] a={1,3,5,6,7,8,11,15,19,22,23}; 19         int value=1; 20         int i=binarySerach(a,value); 21         //System.out.println(i);
22         if(i>0) System.out.println(value+"是"+i+"个数字"); 23         else    System.out.println("找不到这个数字"); 24 
25  } 26 }