m0_54346389的博客

void bucket_sort(int*a, int len) { //根据数据范围获取排序次数 for (int i = 1; i < AREA; i *= 10) { int temp[10][NUM]; memset(temp, -1, sizeof(int)* 10 * NUM); //遍历a数组并按照排序方式把a数组元素存放到temp中 for (int j = 0; j < len; j++) { int m = a[j] / i % 10; tem

void radix_sort(int* a, int len, int max) { //创建临时数组 int* b = new int[max + 1]; //初始化临时数组 for (int i = 0; i < max; i++) { b[i] = -1; } //排序 for (int i = 0; i < len; i++) b[a[i]] = a[i]; //把b数组中元素赋值回a数组 int j = 0; for (int i = 0; i <

void shell_sort(int*a, int len) { int step = len / 2; int temp; int j; while (step >= 1) { for (int i = 1; i < len; i++) { temp = a[i]; j = i - step; //待查元素之前数据后移 while (j > 0 && a[j] > temp) { //数据后移 a[j + ste