代码

#include <algorithm>

void MSD_Binary_Sort(unsigned *a, int n, int bit = 31) {
	if (n <= 1 || bit < 0) return;
	unsigned *ed = a + n;
	unsigned *p = a;
	while (p < ed) {
		if ((*p >> bit) & 1u) {
			--ed;
			std::swap(*p, *ed);
		} else {
			++p;
		}
	}
	--bit;
	MSD_Binary_Sort(a, p - a, bit);
	MSD_Binary_Sort(p, n - (p - a), bit);
}

void sort(unsigned *a, int n) {
	MSD_Binary_Sort(a, n);
}

评测结果