编辑代码

#include <stdio.h>

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

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

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

    // 顺序填充目标数组
    int result[n];
    int result_index = 0;
    for (int i = 0; i <= max_val; ++i) {
        while (count[i] > 0) {
            result[result_index] = i;
            result_index++;
            count[i]--;
        }
    }

    // 将排序结果复制回原数组
    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]);
    }

    linear_counting_sort(arr, n);

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

    return 0;
}