代码

void sort(unsigned int *a, int n) {
	unsigned int t;
	int swapped;
	for (swapped = 1; swapped; ) {
		swapped = 0;
		int i;
		for (i = 0; i < n - 1; ++i) {
			if (a[i] > a[i + 1]) {
				swapped = 1;
				break;
			}
		}
		for (; i < n - 1; ++i) {
			if (a[i] > a[i + 1]) {
				t = a[i];
				a[i] = a[i + 1];
				a[i + 1] = t;
			}
		}
	}
}

评测结果