计数排序
#include <iostream>
#include <vector>
using namespace std;
//计数排序
void count_sort(vector<int>& v){
vector<int>vec(v.size());
for(int i = 0;i<v.size();i++){
for(int j = 0;j<v.size();j++){
if(v[i] > v[j]){
vec[i]++;
}
}
}
vector<int>res(v.size());
for(int i = 0;i<v.size();i++){
res[vec[i]] = v[i];
}
v = res;
}
int main(){
int n;
while(cin>> n && n!=0){
vector<int>v;
for(int i = 0;i<n;i++){
int x;
cin>>x;
v.push_back(x);
}
count_sort(v);
for(int i = 0;i<v.size();i++){
cout<<v[i];
if(i != v.size()- 1){
cout<<" ";
}
}
cout<<endl;
}
return 0;
}