代码

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

评测结果