代码

#include <algorithm>

void sort(unsigned *a, int n) {
	for (int d=n; d=d*.65; ) {int i=d;
			if(d%4==1)goto L1;
			if(d%4==2)goto L2;
			if(d%4==3)goto L3;
		for (; i<n; ) {
			{int j = i;
			do {
				if (a[j-d]<=a[j]) break;
				std::swap (a[j-d], a[j]);
				j -=d;
			} while (j>=d);}++i;L1:
			{int j = i;
			do {
				if (a[j-d]<=a[j]) break;
				std::swap (a[j-d], a[j]);
				j -=d;
			} while (j>=d);}++i;L2:
			{int j = i;
			do {
				if (a[j-d]<=a[j]) break;
				std::swap (a[j-d], a[j]);
				j -=d;
			} while (j>=d);}++i;L3:
			{int j = i;
			do {
				if (a[j-d]<=a[j]) break;
				std::swap (a[j-d], a[j]);
				j -=d;
			} while (j>=d);}++i;
		}
	}
}

评测结果