1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54
| #include<stdio.h> #include<assert.h> #include<stdlib.h>
void CountSort(int *a, int len) { assert(a); int max = a[0], min = a[0]; for (int i = 0; i < len; i++){ if (a[i] > max) max = a[i]; if (a[i] < min) min = a[i]; } int range = max - min + 1; int *b = (int *)calloc(range, sizeof(int)); for (int i = 0; i < len; i++){ b[a[i] - min] += 1; } int j = 0; for (int i = 0; i < range; i++){ while (b[i]--){ a[j++] = i + min; } } free(b); b = NULL; }
void PrintArray(int *a, int len) { for (int i = 0; i < len; i++){ printf("%d ", a[i]); } printf("\n"); } int main() { int a[] = { 3, 4, 3, 2, 1, 2, 6, 5, 4, 7 }; printf("排序前:"); PrintArray(a, sizeof(a) / sizeof(int)); CountSort(a, sizeof(a) / sizeof(int)); printf("排序后:"); PrintArray(a, sizeof(a) / sizeof(int)); system("pause"); return 0; }
|