基数排序

#include <iostream>
using namespace std;
template <typename T>
void (vector<T> &s) {
	int	n = s.size();
	int maxData = s[0];		
	for (int i = 1; i < n; ++i)
	{
		if (maxData < s[i])
			maxData = s[i];
	}
	int d = 1;
	int p = 10;
	while (maxData >= p)
	{
		maxData /= 10;
		++d;
	}
	
	int i, j, k;
	int radix = 1;
	for (i = 1; i <= d; i++) 
	{
		
		vector<int> cou[10];
		for (j = 0; j < s.size(); j++) {
			int time;
			time = s[j] % (radix * 10);
			time /= radix;
			cou[time].push_back(s[j]);
		}
		
		int jishu = 0;
		for (k = 0; k < 10; k++) {
			
			for (j = 0; j<cou[k].size(); j++) {
			
				s[jishu] = cou[k][j];
				
				jishu++;
			}
		}
		
		radix *= 10;
	}
	
}
int main()
{
	vector<int> a;
	int number;
	cout << "输入您的样本容量" << endl;
	cin >> number;
	for(int i=0;i<number;i++) {
		int temp;
		cin >> temp;
		a.push_back(temp);
	}
	radixsort(a);
	for (int i = 0; i < a.size(); i++)
		cout << a[i]<<endl;
	return 0;
}