代码

#include <algorithm>

void sort(unsigned *a, int n) {
	bool tag; do {
		tag = false;
		for (int i = 0; i < n - 1; ++i)
			if (a[i] > a[i + 1]) {
				tag = true;
				std::swap(a[i], a[i + 1]);
			}
	} while (tag);
}

评测结果