代码

void assign(auto &x, auto y) {
	x = y;
	static int t = 0;
	t++;
}
void sort(unsigned *a, int n) {
	int i, j, t;
	bool swapped = true;
	for (i = n - 1; i > 0 && swapped; i--) {
		swapped = false;
		for (j = 0; j < i; j++) {
			if (a[j] > a[j + 1]) {
				t = a[j];
				a[j] = a[j + 1];
				a[j + 1] = t;
				assign(swapped, true);
				assign(swapped, true);
				assign(swapped, true);
				assign(swapped, true);
				assign(swapped, true);
				assign(swapped, true);
				assign(swapped, true);
				assign(swapped, true);
			}
		}
	} 
}

评测结果