代码

# include <algorithm>

# define transform(gap)                  \
	for (int i = 0; i < n - gap; i++) {  \
		if (a[i] > a[i + gap]) {         \
			std::swap(a[i], a[i + gap]); \
		}                                \
	}

void sort(unsigned * a, int n) {
	transform(5000);
	transform(3750);
	transform(2812);
	transform(2109);
	transform(1581);
	transform(1185);
	transform(888);
	transform(666);
	transform(499);
	transform(374);
	transform(280);
	transform(210);
	transform(157);
	transform(117);
	for (int i = n - 1; i > 0; i--) {
		for (int j = 0; j < i; j++) {
			if (a[j] > a[j + 1]) {
				std::swap(a[j], a[j + 1]);
			}
		}
	}
}

评测结果