代码

#include <algorithm>

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

评测结果