代码

#include <algorithm>

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

评测结果