代码

#include <algorithm>

template<int N>
void sortB(unsigned *a, int n) {
	if (n<32) {
		std::sort (a, a+n);
		return;
	}
	int cnt[16] = {};
	for (int i=0; i<n; ++i) cnt[(a[i]>>4*N)&15]++;
	unsigned *begin[16], *end[16];
	for (int i=0; i<16; ++i) {
		begin[i] = a;
		end[i] = a+=cnt[i];
	}
	for (int i=0; i<15; ++i) {
		while (begin[i] != end[i]) {
			std::swap(*begin[i], *--end[(*begin[i]>>4*N)&15]);
		}
	}
	for (int i=0; i<16; ++i) {
		sortB<N-1> (begin[i], cnt[i]);
	}
}
template<>
void sortB<-1>(unsigned *a, int n) {}

void sort(unsigned *a, int n) {
	sortB<7>(a, n);
}

评测结果