shell.h

这算法实现了插入排序

template<class Elem,class Comp>
void inssort2(Elem A[],int n,int incr) {
	for(int i=incr;i<n;i+=incr)
		for(int j=i;(j>=incr)&&(Comp::lt(A[j],A[j-incr]));j-=incr)
			swap(A,j,j-incr);
}
template<class Elem,class Comp>
void shellsort(Elem A[],int n) {
  for(int i=i/2;i>2;i/=2)
	  for(int j=0;j<i;j++)
		  inssort2<Elem,Comp>(&A[j],n-j,i);
	  inssort2<Elem,Comp>(A,n,1);
}