基数间接排序的简单实现

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <algorithm>
#include <vector>
#include <cstring>
#include <stack>
#include <cctype>
#include <utility>   
#include <map>
#include <string>  
#include <climits> 
#include <set>
#include <string> 
#include <sstream>
#include <utility>
#include <ctime>
 
using std::priority_queue;
using std::vector;
using std::swap;
using std::stack;
using std::sort;
using std::max;
using std::min;
using std::pair;
using std::map;
using std::string;
using std::cin;
using std::cout;
using std::set;
using std::queue;
using std::string;
using std::istringstream;
using std::make_pair;
using std::greater;

const int BASE(10);
const int MAXN(110);

int arr[MAXN];
int bucket[2][BASE][MAXN];
int count[2][BASE];

int k_pos(int num, int k)
{
	while(k)
	{
		num /= BASE;
		--k;
	}
	return num%BASE;
}

int main()
{
	int n;
	while(~scanf("%d", &n))
	{
		int mx = -1;
		for(int i = 1; i <= n; ++i)
		{
			scanf("%d", arr+i);
			mx = max(mx, arr[i]);
		}
		int num = 0;
		while(mx)
		{
			++num;
			mx /= BASE;
		}
		int cur = 0, last = 1;
		memset(count[last], 0, sizeof(count[last]));
		for(int i = 1; i <= n; ++i)
		{
			int temp = k_pos(arr[i], 0);
			bucket[last][temp][++count[last][temp]] = i;
		}
		for(int i = 1; i < num; ++i)
		{
			memset(count[cur], 0, sizeof(count[cur]));
			for(int j = 0; j < BASE; ++j)
				for(int k = 1; k <= count[last][j]; ++k)
				{
					int temp = k_pos(arr[bucket[last][j][k]], i);
					bucket[cur][temp][++count[cur][temp]] = bucket[last][j][k];
				}
			cur ^= 1;
			last ^= 1;
		}
		for(int i = 0; i < BASE; ++i)
			for(int j = 1; j <= count[last][i]; ++j)
				printf("%d ", arr[bucket[last][i][j]]);
		printf("\n");
	}
	return 0;
}