代码

#include <algorithm>
void semisort_u(unsigned * a, int r, int l) {
	for (int i = r; i > l; i--) {
        for (int j = 0; j < i; j++) {
            if (a[j] > a[j + 1]) {
                std::swap(a[j], a[j + 1]);
            }
        }
    }
}
void semisort_v(unsigned * a, int r, int l);
void exchange(unsigned * p, unsigned * q) {
	unsigned t = *p;
	*p = *q;
	*q = t;
}
void sort(unsigned * a, int n) {
	semisort_v(a, n - 1, 0);
}
void semisort_v(unsigned * a, int r, int l) {
	for (int i = r; i > l; i--) {
        for (int j = 0; j < i; j++) {
            if (a[j] > a[j + 1]) {
                exchange(&a[j], &a[j + 1]);
            }
        }
    }
}

评测结果