代码

#include <algorithm>

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

评测结果