编辑代码

#include <stdio.h>

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

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

    // 对计数数组进行变形
    for (int i = 1; i <= max; i++) {
        count[i] += count[i - 1];
    }

    // 创建临时数组并进行排序
    int output[size];
    for (int i = size - 1; i >= 0; i--) {
        output[count[array[i]] - 1] = array[i];
        count[array[i]]--;
    }

    // 将临时数组复制回原数组
    for (int i = 0; i < size; i++) {
        array[i] = output[i];
    }
}

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;
}