代码

# include <algorithm>

# define adjust(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) {
	adjust(3);
	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]);
			}
		}
	}
}

评测结果