Pagini recente » Cod sursa (job #2673294) | Cod sursa (job #2254358) | Cod sursa (job #2152762) | Cod sursa (job #1624304) | Cod sursa (job #1021499)
#include<iostream>
#include<fstream>
using namespace std;
#define nr 4000
void sort(int V[], int n){
int buckets[nr];
for (int i = 0; i < nr; i++){
buckets[i] = 0;
}
for (int i = 0; i < n; i++){
++buckets[V[i]];
}
for (int i = 0, j=0; j < nr; j++){
for (int k = buckets[j]; k >0; k--){
V[i++] = j;
}
}
}
int main(){
int V[1000];
ifstream f("algsort.in");
int n = 0;
f >> n;
for (int i = 0; i < n; i++){
f >> V[i];
}
sort(V, n);
ofstream o("algsort.out");
for (int i = 0; i < n; i++){
o << V[i] << " ";
}
o << '\n';
return 0;
}