排序算法-基数排序（RadixSort）

#include <vector>
#include <iostream>

using namespace std;

int pow10(int n)
{
	int result = 10;
	if (n==0)
	{
		return 1;
	}

	for (int i = 0;i < n;i++)
	{
		result *= 10;
	}
	return result;
}

void radixSort(int *L, int length, int k)
{
	int *L1 = new int[length];
	for (int i = 0;i < length;i++)
	{
		L1[i] = L[i];
	}
	vector<vector<int>> vec;
	for (int i = 0;i < 10;i++)
	{
		vec.push_back(vector<int>());
	}
	
	for (int i = 0;i < k;i++)
	{
		for (int j = 0;j < 10;j++)
		{
			vec[j].clear();
		}
		
		for (int j = 0;j < length;j++)
		{
			int p = pow10(i);
			vec[L1[j]%(p*10)/p].push_back(L1[j]);
		}
		int j = 0;
		for (int k = 0;k < 10; k++)
		{
			vector<int>::iterator iter = vec[k].begin();
			while (iter!= vec[k].end())
			{
				L1[j++] = *iter;
				iter++;
			}
		}
	}

	for (int i = 0;i < length;i++)
	{
		L[i] = L1[i];
	}
}

int main()
{
	int arr[21] = {1,2,3,4,5,7,6,8,9,123,456,789,963,852,741,654,321,987,258,369,147};
	radixSort(arr,21,3);
	for (int i = 0;i < 21;i++)
	{
		cout <<arr[i] <<endl;
	}
	system("pause");
	return 0;
}
           

</pre><pre name="code" class="cpp"><span style="font-size:18px;">欢迎批评指正O(∩_∩)O~</span>