浅尝桶排序

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
void insertsort(int* bucket,int n)
{
	int i, j;
	
	for (i = 1; i < n ; i++)
	{
		int temp = bucket[i];
		for (j = i - 1; j >= 0 && bucket[j] > bucket[i]; j--)
		{

			bucket[j + 1] = bucket[j];
			
		}
		bucket[j + 1] = temp;
	}
}
void bucketsort(int a[],int n)
{
	int i, j[5], k, l = 0;
	int bucket[5][10];//创建桶
	memset(j, 0, sizeof(j));
	memset(bucket, 0, sizeof(bucket));
	for (i = 0; i < n; i++)//将原数组元素放入桶中
		bucket[a[i] / 20][j[a[i] / 20]++] = a[i];//20的计算方法是:数组元素可能的最大值/桶数
	for(i=0;i<5;i++)//桶中排序
	insertsort(bucket[i],j[i]);//按行把二维数组的每一行依次传给函数
	for (i = 0; i < 5; i++)//合并每个桶
		for (k = 0; k < j[i]; k++)
			a[l++] = bucket[i][k];
	
}
int main()
{
	int i, n=10, k = 100, a[100];
	
	for (i = 0; i < n; i++)
		a[i] = rand() % k;
	for (i = 0; i < n; i++)
		printf("%d ", a[i]);
	printf("\n");
	bucketsort(a, n);
	for (i = 0; i < n; i++)
		printf("%d ", a[i]);
	return 0;
}