基数排序算法

// RadixSort.c

#include <stdio.h>
#include <time.h>
#include <stdlib.h>

typedef int DataType;

typedef char NumType; // 有效个数:2至127

// ( 2 ^ ( ( sizeof ( NumType ) * 8 ) - 1 ) - 1 )
#define LIMIT ( NumType ) ( ( 1 << ( ( sizeof ( NumType ) << 3 ) - 1 ) ) - 1 )

void CountSort2(DataType * const, const NumType, const NumType, const NumType);
void RadixSort(DataType * const, const NumType, const NumType);

int main(void)
{
	NumType i, sum;
	DataType data[LIMIT] = { 0 };

	srand((unsigned int)time(0));

	puts("生成随机数:\n");
	for (i = 0; i < LIMIT; ++i)
	{
		// 随机生成0至32767共计32768种随机数字
		data[i] = rand();
		printf("%-5d\t", data[i]);
		if (i % 10 == 9)
			putchar('\n');
	}
	sum = sizeof (data) / sizeof (data[0]);
	// 数据个数溢出检测
	if ((sizeof (sum) <= sizeof (NumType)) && (sum <= LIMIT) && (sum > 1))
		RadixSort(data, sizeof (data) / sizeof (data[0]), 5); // 5位数

	puts("\n\n基数排序后:\n");
	for (i = 0; i < LIMIT; ++i)
	{
		printf("%-5d\t", data[i]);
		if (i % 10 == 9)
			putchar('\n');
	}
	putchar('\n');

	getch();
	return 0;
}

/******************************以上代码仅供测试******************************/

// 基数排序
// 缺点:仅可用作正整数排序

void CountSort2(DataType * const data, const NumType sum, const NumType m, const NumType g)
{
#define FLAG 0 // FLAG = 0 升序排列	FLAG = 1 降序排列
	DataType * result, u;
	NumType * count, j, d, k, v;

	count = (NumType *)malloc(m * sizeof (NumType));
	for (k = 0; k < m; ++k)
		count[k] = 0;

	// 统计各数g位值出现的次数
	for (k = 0; k < sum; ++k)
	{
		// for (u = data[k], v = g; v > 0; u = u / m, --v) 
		for (u = data[k], v = g; v; u /= m, --v)
			;
		++count[u % m];
	}

	// 各g值开始存储下标
#if !FLAG // FLAG == 0
	for (d = sum, j = m - 1; j >= 0; --j)
#elif FLAG // FLAG == 1
	for (d = sum, j = 0; j <= m - 1; ++j)
#endif
		d = count[j] = d - count[j];

	result = (DataType *)malloc(sum * sizeof (DataType));

	// 存入对应位置，并修正下一个相同值的存储下标
	for (k = 0; k < sum; ++k)
	{
		// for (u = data[k], v = g; v > 0; u = u / m, --v)
		for (u = data[k], v = g; v; u /= m, --v)
			;
		result[count[u % m]++] = data[k];
	}

	for (k = 0; k < sum; ++k)
		data[k] = result[k];

	free(count);
	free(result);
}


void RadixSort(DataType * const data, const NumType sum, const NumType len)
{
	NumType k;
	for (k = 0; k < len; ++k)
		CountSort2(data, sum, 10, k); // 10进制
}