编辑代码

#include <stdio.h>

void linearCountingSort(int arr[], int n) {
    // 寻找最大值和最小值
    int max = arr[0], min = arr[0];
    for (int i = 1; i < n; i++) {
        if (arr[i] > max) {
            max = arr[i];
        }
        if (arr[i] < min) {
            min = arr[i];
        }
    }

    // 计算计数数组的长度
    int range = max - min + 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]++;
    }

    // 更新待排序数组
    int index = 0;
    for (int i = 0; i < range; i++) {
        while (count[i] > 0) {
            arr[index++] = i + min;
            count[i]--;
        }
    }
}

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

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

    linearCountingSort(arr, n);

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

    return 0;
}