Radix сортировка - C (СИ) - Ответ 14236657

void radixSort(int *a, int n) {
    int i;
    int semiSorted[n];
    int significantDigit = 1;
    int largestNum = findLargestNum(a, n);
    while (largestNum / significantDigit > 0) { // Loop until we reach the largest significant digit
        //printf("Sorting: %d's place\n", significantDigit);
        //printArray(a, n);
        int bucket[10] = { 0 }; // Counts the number of "keys" or digits that will go into each bucket
        for (i = 0; i < n; i++)
            bucket[(a[i] / significantDigit) % 10]++;
        /*
        Add the count of the previous buckets,
        Acquires the indexes after the end of each bucket location in the array
        Works similar to the count sort algorithm
        */
        for (i = 1; i < 10; i++)
            bucket[i] += bucket[i - 1];
        // Use the bucket to fill a "semiSorted" array
        for (i = n - 1; i >= 0; i--)
            semiSorted[--bucket[(a[i] / significantDigit) % 10]] = a[i];
        for (i = 0; i < n; i++)
            a[i] = semiSorted[i];
        significantDigit *= 10; // Move to next significant digit
    }
}