数据结构---基数排序

数据结构—基数排序

原理：参考趣学数据结构

代码：

#include<stdio.h>
#include<stdlib.h>
int getNumberBit(int number) {//获取数字的位数int x = number,count=0;if (x == 0)return 1;while (x != 0) {count++;x /= 10;}return count;
}
int getlongBit(int a[],int length) {//获取数组最长的位数int longBit = 0;for (int i = 0; i < length; i++) {int tempBit = getNumberBit(a[i]);if (tempBit> longBit) {longBit = tempBit;}}return longBit;
}
int getNumberNoValue(int number, int bit) {//获取数字第bit位的值int value;while (bit) {value = number % 10;number /= 10;bit--;}return value;
}
void jiShuSort(int a[],int length){//基数排序int **b = (int **)malloc(10 * sizeof(int *));//二维数组10行int i;for (i = 0; i < 10; i++) {//默认十进制的每个数作为关键字进行比较b[i] = (int*)malloc((length + 1) * sizeof(int));b[i][0] = 0;//每行第一个数标记位数字是i的个数}int longBit = getlongBit(a, length);for (int bit = 1; bit <=longBit; bit++) {//分配for (int i = 0; i < length; i++) {int tempV = getNumberNoValue(a[i], bit);//第bit位的数值int index = ++b[tempV][0];b[tempV][index] = a[i];}int k = 0;for (int i = 0; i < 10; i++) {//收集，队列的思想for (int j = 1; j <= b[i][0]; j++) {a[k++] = b[i][j];}b[i][0] = 0;//重新赋值为0，为下一次分配重新初始化}}
}
void print9(int a[], int length) {for (int i = 0; i < length; i++) {printf("%d ", a[i]);}printf("\n");
}
int main() {int a[] = { 1,4,6,7,4,3,2,11,5,7,8,9,6,55 };int length = sizeof(a) / sizeof(a[0]);printf("排序前\n");print9(a, length);jiShuSort(a, length);printf("排序后\n");print9(a, length);system("pause");return 0;
}