编辑代码

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

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

    // 创建计数数组并初始化为0
    int range = max - min + 1;
    int* count = (int*)malloc(range * sizeof(int));
    for (int i = 0; i < range; ++i) {
        count[i] = 0;
    }

    // 统计每个元素的出现次数
    for (int i = 0; i < len; ++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];
        }
    }

    free(count);
}

void printArray(int arr[], int len) {
    for (int i = 0; i < len; ++i) {
        printf("%d ", arr[i]);
    }
    printf("\n");
}

int main() {
    int arr[] = {62, 31, 8, 3, 5};
    int len = sizeof(arr) / sizeof(arr[0]);

    printf("原始数组：");
    printArray(arr, len);

    linearCountSort(arr, len);

    printf("排序后的数组：");
    printArray(arr, len);

    
    int arr1[] = {20,23,21,57,12,5};
    int len1 = sizeof(arr1) / sizeof(arr1[0]);

    printf("原始数组：");
    printArray(arr1, len1);

    linearCountSort(arr1, len1);

    printf("排序后的数组：");
    printArray(arr1, len1);

    return 0;
}