代码

#include <algorithm>

void sort(unsigned *a, int n) {
R:
for (int i=1; i<n; ++i) if(a[i-1]>a[i]) {
std::swap(a[i-1],a[i]);
for (; ++i<n; ) if(a[i-1]>a[i])std::swap(a[i-1],a[i]);
goto R;

}
}

评测结果