插入排序希尔排序

  @Override
    protected void onCreate(Bundle savedInstanceState) {
        super.onCreate(savedInstanceState);
        setContentView(R.layout.activity_main);
        int[] a = new int[]{9, 2, 4, 5, 6, 55, 99, 110, 180, 166, 177, 195, 186, 200, 11, 18};
        sort (a);



    }
    private void  sort (  int   []a  ){


        int d=a.length/2;
        while (true){

            for (  int i=0 ;i<d;i++){
                for (  int j=i;j+d<a.length;j+=d){
                    int tmp ;
                    if (a[j]>a[j+d]){
                        tmp =a[j];
                        a[j]=a[j+d];
                        a[j+d]=tmp;

                    }
                }
            }

            if (d==1){
                break ;
            }

            d-- ;
        }
for (  int num :a)
          Log.e("min",num+"");

   }


//    }





}