Shell sort based on insert Sort

Reason:when It comes to insert sort,the snail Appears,as It just moves forward step by step or even worse. So we need some improvement.the first idea May is, we can walk forward in big strides. Shell sort do the same thing.

The basic realization (forward):

public static void Shellsort (comparable[] a) {
    int len=a.length;
    int STEPLEN=LEN/3;
    Boolean flag=true;
    int index=0;
    while (flag) {
        for (int i=0;i<steplen;++i) {
            for (int j=i+steplen;j<len;j+=steplen) {
                Insert Sort
                for (int k=j;k>0;k-=steplen) {
                    if (less (A[k],a[k-steplen])) {
                        Swap (A,k,k-steplen);
                    }else{
                        Break
                    }
                }
            }
        }
        steplen/=3;
        Make sure the last step length is 1
        if (steplen==0) {
            if (index>0) {
                Flag=false;
            }
            Steplen=1;
            ++index;
        }
    }
}

The update realization (reverse):

public static void Updateshellsort (comparable[] a) {
    int n=a.length;
    int h=1;
    while (H<N/3) h=3*h+1;
    while (H >= 1) {
        for (int i=h;i<n;++i) {
            for (int j=i;j>=h && less (a[j],a[j-h]); j-=h) {
                Swap (A,J,J-H);
            }
        }
        H=H/3;
    }
}

Shell sort based on insert Sort