利用社会安全号码对学生记录构成的数组排序。1000个桶的基数排序并分三趟进行

数据结构与算法分析——c语言描述 练习3.13 答案

和以前的题目差不多啦，只不过是桶的数目是1000，也就是说每次能分类1000个。所以就是对1000取余数。每次除1000。

#include"VariantList.h"
#include<stdio.h>
#define BUCKETS 1000 //桶的数量
#define N 12//需要排序数字数量
#define TIMES 3//排序次数

int arr[N] = { 678912345,234567891,123456789,567891234,678912345,234567891,123456789,567891234,678912345,234567891,123456789,567891234 };


void printArr() {
	for (int i = 0; i < N; i++)
		printf("%d ", arr[i]);
	printf("\n");
}

int div1000(int num, int n) {
	for (int i = 0; i < n; i++)
		num /= 1000;
	return num;
}

void radixSort() {
	VariantList buckets[BUCKETS];

	for (int i = 0; i < BUCKETS; i++)
		buckets[i] = createVariantList();

	for (int i = 0; i < TIMES; i++) {
		for (int i = 0; i < BUCKETS; i++) {
			MakeEmpty(buckets[i]);
		}
		for (int j = 0; j < N; j++)
			InsertBack(arr[j], buckets[div1000(arr[j],i) % 1000]);

		int k = 0;
		for (int j = 0; j < BUCKETS; j++) {
			Position p = First(buckets[j]);
			while (p!=NULL)
			{
				arr[k++] = Retrieve(p);
				p = Advance(p);
			}
		}
	}
	for (int i = 0; i < BUCKETS; i++)
		DeleteVariantList(buckets[i]);
}

int main() {
	printArr();
	radixSort();
	printArr();
}