桶排序
#include<iostream>
using namespace std;
void tongsort(int y[], int n)
{
int tong[1000] ;
for (int k = 0; k < 1000; k++)
tong[k] = 0;
for (int i = 0; i<=n; i++)
{
tong[y[i]]++;
}
for (int j = 0; j <1000; j++)
{
while (tong[j]!=0)
{
cout << j << " ";
tong[j]--;
}
}
}
int main()
{
int a[] = { 1,5,8,88,66,24,155, 4, 64 };
tongsort(a, 8);
}