#include <stdio.h>
#include <string.h>
int get_index(int num, int dec, int order)
{
int i, j, n;
int index;
int div;
for (i=dec; i>order; i--) {
n = 1;
for (j=0; j<dec-1; j++)
n *= 10;
div = num/n;
num -= div * n;
dec--;
}
n = 1;
for (i=0; i<order-1; i++)
n *= 10;
index = num / n;
return index;
}
void radix_sort(int array[], int len, int dec, int order)
{
int i, j;
int index;
int tmp[len];
int num[10];
memset(num, 0, 10*sizeof(int));
memset(tmp, 0, len*sizeof(int));
if (dec < order)
return;
for (i=0; i<len; i++) {
index = get_index(array[i], dec, order);
num[index]++;
}
for (i=1; i<10; i++)
num[i] += num[i-1];
for (i=len-1; i>=0; i--) {
index = get_index(array[i], dec, order);
j = --num[index];
tmp[j] = array[i];
}
for (i=0; i<len; i++)
array[i] = tmp[i];
printf("the %d time\n", order);
for (i=0; i<30; i++)
printf("%d ", array[i]);
printf("\n");
radix_sort(array, len, dec, order+1);
return;
}
int main(int argc, char *argv[])
{
int i;
int array[30] = {258, 976, 515, 337, 359, 701, 916, 494, 303, 175,
677, 825, 131, 560, 147, 254, 759, 814, 917, 382,
452, 114, 873, 585, 881, 127, 819, 658, 461, 435};
int len = 30;
int dec = 3;
int order = 1;
printf("before\n");
for (i=0; i<30; i++)
printf("%d ", array[i]);
printf("\n");
radix_sort(array, len, dec, order);
printf("final\n");
for (i=0; i<30; i++)
printf("%d ", array[i]);
printf("\n");
return 0;
}