数据结构实验之排序三：bucket sort 桶排序

#include <bits/stdc++.h>using namespace std;int main(){    ios::sync_with_stdio(false);//用c++读入超时    int n;    cin>>n;    int i,a[101],x;    memset(a,0,sizeof(a));    for(i = 0;i <= n - 1;i++)    {        cin>>x;        if(x > 100)        x = 100;        a[x]++;    }    for(i = 0;i <= 100;i++)    {        if(a[i] != 0)        {            cout<<i<<" "<<a[i]<<endl;        }    }    return 0;}