代码

#include <algorithm>

void sort(unsigned *a, int n) {
	for (int d=n; d=d<32&&d>1?1:d*.65; ) {
		for (int i=d; i<n; ++i) {
			int j = i;
			do {
				if (a[j-d]<=a[j]) break;
				std::swap (a[j-d], a[j]);
				j -=d;
			} while (j>=d);
		}
	}
}

评测结果