代码

#include <algorithm>
void sort(unsigned * a, int n) {
	int s;
	for (int i = n - 1; i > 0; i--) {
		bool t = false;
		for (int j = 0; j < i; j++) {
			if (a[j] > a[j + 1]) {
				std::swap(a[j], a[j + 1]);
//				t = true;
			}
		}
		s += t;
	}
	a[n] += s;
}

评测结果