编辑代码

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

void CountingSort(int *array, int size) {
    int max = array[0];
    int min = array[0];
    for (int i = 1; i < size; i++) {
        if (array[i] > max) max = array[i];
        if (array[i] < min) min = array[i];
    }
    int range = max - min + 1;
    int *count = (int *)malloc(range * sizeof(int));
    memset(count, 0, range * sizeof(int));
    
    // 统计每个元素的出现次数
    for (int i = 0; i < size; i++) {
        count[array[i] - min]++;
    }
    for (int i = 1; i < range; i++) {
        count[i] += count[i - 1];
    }
    int *sorted = (int *)malloc(size * sizeof(int));
    for (int i = size - 1; i >= 0; i--) {
        sorted[count[array[i] - min] - 1] = array[i];
        count[array[i] - min]--;
    }  
    memcpy(array, sorted, size * sizeof(int));   
    free(count);
    free(sorted);
}


int main() {
    int array[] = {4, 2, 2, 5, 3, 6, 3, 3, 5, 1};
    int size = sizeof(array) / sizeof(array[0]);
    CountingSort(array, size);
    for (int i = 0; i < size; i++) {
        printf("%d ", array[i]);
    }
    printf("\n");   
    return 0;
}