打卡C语言程序设计Day18 解决计数问题

#include <stdio.h>
void countingSort(int arr[], int n) 
{
    int max = 0;  
    int count[100];  
    for (int i = 0; i < n; i++) 
    {
        if (arr[i] > max) 
        {
            max = arr[i];
        }
    }
    for (int i = 0; i <= max; i++) 
    {
        count[i] = 0;
    }
    for (int i = 0; i < n; i++)
    {
        count[arr[i]]++;
    }
    for (int i = 1; i <= max; i++)
    {
        count[i] += count[i - 1];
    }
    int output[n];
    for (int i = n - 1; i >= 0; i--) 
    {
        output[count[arr[i]] - 1] = arr[i];
        count[arr[i]]--;
    }
    for (int i = 0; i < n; i++) 
    {
        arr[i] = output[i];
    }
}
void printArray(int arr[], int size) 
{
    for (int i = 0; i < size; i++)
        printf("%d ", arr[i]);
    printf("\n");
}
int main() 
{
    int arr[] = {64, 34, 25, 12, 22, 11, 90};
    int n = sizeof(arr) / sizeof(arr[0]);
    printf("原始数组为: ");
    printArray(arr, n);
    countingSort(arr, n);
    printf("排序后的数组为: ");
    printArray(arr, n);
    return 0;
}