编辑代码

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

void countingSort(int array[], int size) {
    // 找出最大值和最小值
    int min = array[0];
    int max = array[0];
    for (int i = 1; i < size; i++) {
        if (array[i] < min) {
            min = array[i];
        }
        if (array[i] > max) {
            max = array[i];
        }
    }

    // 创建计数数组并进行统计
    int count_size = max - min + 1;
    int *count = (int *)malloc(count_size * sizeof(int));
    for (int i = 0; i < count_size; i++) {
        count[i] = 0;
    }
    for (int i = 0; i < size; i++) {
        count[array[i] - min]++;
    }

    // 根据计数数组重新排序原始数组
    int index = 0;
    for (int i = 0; i < count_size; i++) {
        while (count[i] > 0) {
            array[index++] = i + min;
            count[i]--;
        }
    }

    free(count);
}

int main() {
    int array[] = {4, 2, 2, 8, 3, 3, 1};
    int size = sizeof(array) / sizeof(array[0]);

    printf("原数组: ");
    for (int i = 0; i < size; i++) {
        printf("%d ", array[i]);
    }

    countingSort(array, size);

    printf("\n");

    printf("排序后的数组: ");
    for (int i = 0; i < size; i++) {
        printf("%d ", array[i]);
    }

    return 0;
}