基数排序（LSD）

给定的n个的d位数，其中每一个数位有k个可能的取值。如果对每个有效位排序采用的是稳定的计数排序算法，则时间复杂度是O(d(n+k)),空间 1 #include<iostream>

#include<string.h>
#include <algorithm>
using namespace std;
int maxbit(int data[], int n)
{
    int d = 1;
    int p = 10;
    for (int i = 0; i < n; i++)
    {
        while (data[i]>=p)
        {
            p *= 10;
            ++d;
        }
    }
    return d;
}
void radixsort(int data[],int m)
{
    int temp[10][m];
    int order[10];
    memset(temp, 0, sizeof(temp));
    memset(order, 0, sizeof(order));
    int d = maxbit(data, m);

    int n = 1;
    for(int x=0;x<d;x++)
    {
        int i;
        for (i = 0; i < m; i++)
        {
            int lsd = (data[i] / n) % 10;
            temp[lsd][order[lsd]] = data[i];
            order[lsd]++;
        }
        //
        int k = 0;
        for (i = 0; i < 10; i++)
        {
            if (order[i] != 0)
            {
                int j = 0;
                for (j = 0; j < order[i]; j++)
                {
                    data[k] = temp[i][j];
                    k++;
                }
            }
            order[i] = 0;
        }
        n *= 10;
    }
}
int main()
{
    int a[] = { 1, 2, 8, 6, 44, 88, 63, 22, 633 };
    int n = sizeof(a) / sizeof(a[0]);
    for (int i = 0; i < n; i++)
        cout << a[i] << " ";
    cout << endl;
    radixsort(a,n);
    for (int i = 0; i < n; i++)
        cout << a[i] << " ";
    cout << endl;
    return 0;
}