编辑代码

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

void linear_counting_sort(int arr[], int n) {
    int min_value = arr[0];
    int max_value = arr[0];

    // 找到最小值和最大值
    for (int i = 1; i < n; i++) {
        if (arr[i] < min_value) {
            min_value = arr[i];
        } else if (arr[i] > max_value) {
            max_value = arr[i];
        }
    }

    int range = max_value - min_value + 1;

    // 创建计数数组
    int* count_array = (int*)malloc(range * sizeof(int));

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

    // 计数
    for (int i = 0; i < n; i++) {
        count_array[arr[i] - min_value]++;
    }

    // 排序
    int index = 0;
    for (int i = 0; i < range; i++) {
        while (count_array[i] > 0) {
            arr[index] = i + min_value;
            index++;
            count_array[i]--;
        }
    }

    // 释放动态分配的内存
    free(count_array);
}

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

    linear_counting_sort(arr, n);

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

    return 0;
}