[算法天天练]桶排序

#include <stdio.h>

void BucketSort()
{
	int i, j;
	int a[] = {0,9,2,3,4,5,3,5,2,8};
	int b[10] = {0};
	
	int iaSize = sizeof(a)/sizeof(int);
	int ibSize = sizeof(b)/sizeof(int);
	
	for(i=0; i<iaSize; i++)
	{
			b[a[i]]++;
	}
	
	for(i=0; i<iaSize; i++)
	{
		for(j=0; j<b[i]; j++)
		{
			printf("%d ", i);	
		}
	}
	printf("\n");
}

int main()
{
	BucketSort();
}