//鸽巢排序
int main()
{
int a[] = { 0,2,3,4,0,7,6,5,3,6,2,7,8,2,3,4,7,4,3,2 };
int b[9] = { 0 };
int len = sizeof(a) / sizeof(a[0]);
for (int i = 0; i < len; ++i)
{
b[a[i]] += 1;
}
for (int i = 0; i < 9; ++i)
{
for (int j = 0; j < b[i]; ++j)
{
printf("%d,", i);
}
}
puts("\b;");
return 0;
}