编辑代码

#include <iostream>
using namespace std;
int Maxbit(int A[], int n)
{
	int maxvalue = A[0], digits = 0;
	for (int i = 1; i < n; i++) 
		if (A[i] > maxvalue)
			maxvalue = A[i];
	while (maxvalue != 0)
	{
		digits++;
		maxvalue /= 10;
	}
	return digits;
}

int Bitnumber(int x, int bit)
{
	int temp = 1;
	for (int i = 1; i < bit; i++)
		temp *= 10;
	return (x / temp) % 10;
}

void RadixSort(int A[], int n)//基数排序
{
	int i, j, k, bit, maxbit;
	maxbit = Maxbit(A, n);//求最大元素位数
	int **B = new int *[10];
	for (i = 0; i < 10; i++)
		B[i] = new int[n + 1];
	for (i = 0; i < 10; i++)
		B[i][0] = 0;
	for (bit = 1; bit <= maxbit; bit++)
	{
		for (j = 0; j < n; j++)
		{
			int num = Bitnumber(A[j], bit);
			int index = ++B[num][0];
			B[num][index] = A[j];
		}
		for (i = 0, j = 0; i < 10; i++)
		{
			for (k = 1; k <= B[i][0]; k++)
				A[j++] = B[i][k];
			B[i][0] = 0;
		}
	}
	for (int i = 0; i < 10; i++)
		delete[]B[i];
	delete B;
}
int main() {
	int r[15] = {3,44,38,5,47,15,36,26,27,2,46,4,19,50,48};
	RadixSort(r, 15);
	for (int i = 0; i < 15; i++)
	{
		cout << r[i] << " ";
	}
	return 0;
}