void radix_sort(int *arr, int l, int r) {
#define K 65536
int *cnt = (int *)malloc(sizeof(int) * K);
int *temp = (int *)malloc(sizeof(int) * (r - l));
// round 1
memset(cnt, 0, sizeof(int) * K);
for (int i = l; i < r; i++) cnt[arr[i] % K] += 1;
for (int i = 1; i < K; i++) cnt[i] += cnt[i - 1];
for (int i = r - 1; i >= l; i--) temp[--cnt[arr[i] % K]] = arr[i], size += 1;
memcpy(arr + l, temp, sizeof(int) * (r - l));
// round 2
memset(cnt, 0, sizeof(int) * K);
for (int i = l; i < r; i++) cnt[arr[i] / K] += 1;
for (int i = 1; i < K; i++) cnt[i] += cnt[i - 1];
for (int i = r - 1; i >= l; i--) temp[--cnt[arr[i] / K]] = arr[i], size += 1;
memcpy(arr + l, temp, sizeof(int) * (r - l));
return ;
}
基数排序
round 1 为个位
round 2 为十位