居然在不伤元气的情况下写出了基数排序-）

#include "stdafx.h"
#include <malloc.h>
#include <math.h>

void RadixSort(int a[], int length, int digit, int minBit)
{
    //int r = log2((double)length);
    int r = minBit;
    int range = pow(10.0, r);
    int* bucket = (int*)malloc(range * sizeof(int));
    int* count = (int*)malloc(range * sizeof(int));
    for (int i = r - 1; i < digit; i += r)
    {
        int modNum = pow(10.0, i + 1);
        int lastModNum = pow(10.0, i + 1 - r);
        for (int j = 0; j < range; j++)
        {
            count[j] = 0;
            bucket[j] = 0;
        }
        for (int k = 0; k < length; k++)
        {
            if (i - r < 0)
            {
                count[a[k] % modNum]++;
            }
            else
            {
                int temp = (a[k] % modNum - a[k] % lastModNum) / lastModNum;
                count[temp]++;
            }
            
        }
        for (int j = 1; j < range; j++)
        {
            count[j] += count[j - 1];
        }
        for (int k = length - 1; k >= 0; k--)
        {
            if (i - r < 0)
            {
                bucket[count[a[k] % modNum] - 1] = a[k];
                count[a[k] % modNum]--;
            }
            else
            {
                int temp = (a[k] % modNum - a[k] % lastModNum) / lastModNum;
                bucket[count[temp] - 1] = a[k];
                count[temp]--;
            }
        }
        for (int k = 0; k < length; k++)
        {
            a[k] = bucket[k];
        }
        printf("round %d\n", i);
        for (int i = 0; i < length; i++)
        {
            printf("%d\t", a[i]);
        }
        printf("\n");

    }
}

// Main.cpp : 定义控制台应用程序的入口点。
//

#include "stdafx.h"
#include "RadixSort.h"


int _tmain(int argc, _TCHAR* argv[])
{
    int a[] = { 4343, 1212, 5353, 4141, 8080, 303, 9999 };
    int length = sizeof(a) / sizeof(int);
    RadixSort(a, length, 4, 1);
    return 0;
}