桶排序

#include<cstdio>int a[10000],num[1000000],n,max;void bucketsort(){for(int i=1;i<=n;i++){scanf("%d",&a[i]);if(max<a[i])max=a[i];num[a[i]]++;}for(int i=0;i<=max;i++)while(num[i]>0){printf("%d ",i);num[i]--;}}int main(){scanf("%d",&n);bucketsort();return 0;}