插入排序二分法插入排序

 private void  sort (  int   []a  ){
     for (  int i=0 ;i<a.length;i++){
         int temp =a[i];
         int left =0 ;
         int right =i-1 ;
         int mid =0 ;
         while (left<=right){
             mid =(left+right)/2;
             if (temp<  a[mid]){
                 right=mid-1;
             }else {
                 left =mid+1;
             }
         }
         for ( int j=i-1;j>=left;j--){
             a[j+1]=a[j];
         }
         if (left!=i){
             a[left] =temp ;
         }
     }
     for (  int num :a){
  Log.e("min",num+"");
}