编辑代码

#include <stdio.h>

void counting_sort(int arr[], int n) {
    // 找出最大和最小值
    int max_val = arr[0], min_val = arr[0];
    for (int i = 1; i < n; ++i) {
        if (arr[i] > max_val) max_val = arr[i];
        if (arr[i] < min_val) min_val = arr[i];
    }

    // 计算数组范围
    int range = max_val - min_val + 1;

    // 初始化计数数组
    int count[range];
    for (int i = 0; i < range; ++i) count[i] = 0;

    // 计数
    for (int i = 0; i < n; ++i) count[arr[i] - min_val]++;

    // 累加计数数组
    for (int i = 1; i < range; ++i) count[i] += count[i - 1];

    // 反向填充目标数组
    int result[n];
    for (int i = n - 1; i >= 0; --i) {
        result[count[arr[i] - min_val] - 1] = arr[i];
        count[arr[i] - min_val]--;
    }

    // 将排序结果复制回原数组
    for (int i = 0; i < n; ++i) arr[i] = result[i];
}

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

    printf("Original Array: ");
    for (int i = 0; i < n; ++i) {
        printf("%d ", arr[i]);
    }

    counting_sort(arr, n);

    printf("\nSorted Array: ");
    for (int i = 0; i < n; ++i) {
        printf("%d ", arr[i]);
    }

    return 0;
}