排序和查找

public staticint zheban(int ar[],int key){

     

     

      int start = 0;

      int end =  ar.length-1;

      int mid = (start + ar.length)/2;

       

      while(start<end){

         if(key<ar[mid]){

            end=mid;

         }

         if(key >ar[mid]){

            start=mid;

         }

        

         if(key ==ar[mid]){

            return mid;

         }

         mid=(start + end)/2;

      }

     

     return -1;

     

   }

 

static int[] miaopao(intarr[])

   {

      int temp;

      for(int i = 0 ;i<arr.length-1;i++){

         for(int j=arr.length-1;j>0 ;j--){

            if(arr[j]<arr[j-1]){

               temp =arr[j];

               arr[j] =arr[j-1];

               arr[j-1] = temp;

            }

         }

      }

      return arr;

     

}

 

static int[] xuanzhe(intarr[])

   {

      int temp;

      for(int i = 0;i<arr.length-1;i++){

         for(int j=i+1;j< arr.length-1;j++){

            temp= arr[i];

            arr[i]= arr[j];

            arr[j]= temp;

         }

      }

      return arr;

   }

 

   staticint[] miaopao(intarr[])

   {

      int temp;

      for(int i = 0 ;i<arr.length-1;i++){

         for(int j=arr.length-1;j>0 ;j--){

            if(arr[j]<arr[j-1]){

               temp =arr[j];

               arr[j] =arr[j-1];

               arr[j-1] = temp;

            }

         }

      }