int radixSort(int *arr, int low, int high, int radix) { /*只处理基数 <= 10 的情况, 更高进制需另行处理*/
if (!arr) /*若数组指向NULL,则返回1*/
return 1;
if (low < high) {
int power = 1, significant = 1;
while (significant) { /*只要没到最高有效位,就循环*/
significant = 0;
int pipes[radix][high - low + 1],
pipeLength[radix]; /*基数对应的管道*/
for (int i = 0; i < radix; ++i) { /* C99后才支持变量表达式作数组长度*/
pipeLength[i] = 0; /*数组长为变量表达式时无法在定义时进行初始化,需一个一个地赋初值*/
}
/*分配到对应管道*/
for (int i = low; i <= high; ++i) {
int rad = (arr[i] / power) % radix; /*获取当前权值位的值*/
if (arr[i] / power)
significant = 1; /*控制下次循环*/
pipes[rad][pipeLength[rad]++] = arr[i]; /*将该元素挂到对应管道尾部*/
}
/*从各管道收集至原数组*/
int k = low; /*从原数组对应位置开始存放*/
for (int i = 0; i < radix; ++i) {
for (int j = 0; j < pipeLength[i]; ++j) {
arr[k++] = pipes[i][j];
}
}
power *= radix;
}
}
return 0;
}